proposition: Lemma lmc_gen_start: forall g old new n, gen_start (lgraph_mark_copied g old new) n = gen_start g n.
proof: Proof. intros. unfold gen_start. do 2 if_tac. - unfold nth_gen. simpl. reflexivity. - unfold graph_has_gen in *. simpl in *. contradiction. - unfold graph_has_gen in *. simpl in *. contradiction. - 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