proposition: Lemma lcv_rootpairs_compatible_unchanged: forall g rootpairs roots v to, graph_has_gen g to -> roots_graph_compatible roots g -> rootpairs_compatible g rootpairs roots -> rootpairs_compatible (lgraph_copy_v g v to) rootpairs roots.
proof: Proof. intros. unfold cut_thread_info, rootpairs_compatible in *; simpl in *. rewrite <- H1; clear H1. pose proof lcv_vertex_address_old g. induction roots; simpl; auto. f_equal. - destruct a; auto. destruct v0; auto. hnf in H0; simpl in H0. inv H0. unfold root2val. apply H1; auto. - apply IHroots; auto. red in H0|-*. destruct a; auto. destruct v0; auto. simpl in H0. inv H0; auto. 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