proposition: Lemma lmc_outlier_compatible: forall g outlier old new, outlier_compatible g outlier -> outlier_compatible (lgraph_mark_copied g old new) outlier.
proof: Proof. intros. intro v. intros. rewrite <- lmc_graph_has_v in H0. unfold lgraph_mark_copied, update_copied_old_vlabel, update_vlabel; simpl. if_tac; simpl; apply H; [unfold equiv in H1; subst|]; 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