proposition: Lemma svfl_raw_mark: forall from to v l g g', graph_has_gen g to -> scan_vertex_for_loop from to v l g g' -> forall x, graph_has_v g x -> vgeneration x <> from -> raw_mark (vlabel g x) = raw_mark (vlabel g' x).
proof: Proof. do 4 intro. revert from to v. induction l; intros; simpl; inversion H0; subst. 1: reflexivity. assert (graph_has_gen g2 to) by (eapply fr_graph_has_gen in H5; [rewrite <- H5 |]; assumption). assert (graph_has_v g2 x) by (eapply fr_graph_has_v in H5; eauto). eapply (IHl from to _ g2) in H8; eauto. rewrite <- H8. eapply fr_raw_mark; eauto. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen