proposition: Lemma fl_raw_tag: forall depth from to l g g', graph_has_gen g to -> forward_loop from to depth l g g' -> forall v, graph_has_v g v -> vgeneration v <> from -> raw_tag (vlabel g v) = raw_tag (vlabel g' v).
proof: Proof. intros. revert g g' H H0 v H1 H2. induction l; intros; inversion H0; subst. 1: reflexivity. transitivity (raw_tag (vlabel g2 v)). - apply (fr_raw_tag _ _ _ _ _ _ H H6 _ H1 H2). - apply IHl; [|assumption| |assumption]. + erewrite <- fr_graph_has_gen; eauto. + eapply fr_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