proposition: Lemma graph_has_gen_reset: forall (g: LGraph) gen1 gen2, graph_has_gen (reset_graph gen1 g) gen2 <-> graph_has_gen g gen2.
proof: Proof. intros. unfold graph_has_gen. simpl. rewrite reset_nth_gen_info_length. rewrite remove_ve_glabel_unchanged. reflexivity. 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