proposition: Lemma fl_graph_has_v: forall from to depth l g g', graph_has_gen g to -> forward_loop from to depth l g g' -> forall v, graph_has_v g v -> graph_has_v g' v.
proof: Proof. intros. revert g g' H H0 v H1. induction l; intros; inversion H0; subst. 1: assumption. cut (graph_has_v g2 v). - intros. assert (graph_has_gen g2 to) by (apply (fr_graph_has_gen _ _ _ _ _ _ H H5); assumption). apply (IHl _ _ H3 H8 _ H2). - apply (fr_graph_has_v _ _ _ _ _ _ H H5 _ H1). 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