proposition: Lemma lacv_graph_has_v_old: forall g v to x, graph_has_gen g to -> graph_has_v g x -> graph_has_v (lgraph_add_copied_v g v to) x.
proof: Proof. intros. destruct H0. split. - rewrite lacv_graph_has_gen; assumption. - red. destruct (Nat.eq_dec (vgeneration x) to). + rewrite e in *. unfold nth_gen. simpl. rewrite cvmgil_eq by assumption. simpl. red in H1. unfold nth_gen in H1. lia. + rewrite lacv_nth_gen; assumption. 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