proposition: Lemma svfl_gen_v_num_to: forall from to v l g1 g2, graph_has_gen g1 to -> scan_vertex_for_loop from to v l g1 g2 -> gen_v_num g1 to <= gen_v_num g2 to.
proof: Proof. intros ? ? ? ?. induction l; intros; inversion H0; subst. 1: lia. assert (graph_has_gen g3 to) by (rewrite <- fr_graph_has_gen; eauto). specialize (IHl _ _ H1 H6). transitivity (gen_v_num g3 to); auto. eapply fr_O_gen_v_num_to; 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