proposition: Lemma svwl_raw_fields: forall from to l g g', graph_has_gen g to -> scan_vertex_while_loop from to l g g' -> forall v, graph_has_v g v -> raw_fields (vlabel g v) = raw_fields (vlabel g' v).
proof: Proof. do 3 intro. induction l; intros; inversion H0; subst. 1: reflexivity. 1: eapply IHl; eauto. erewrite <- (IHl g2 g'); eauto. - eapply svfl_raw_fields; eauto. - rewrite <- svfl_graph_has_gen; eauto. - eapply svfl_graph_has_v; 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