proposition: Lemma lgd_super_compatible: forall g (h: heap) (rootpairs: list rootpair) roots outlier v' e, super_compatible g h rootpairs roots outlier -> super_compatible (labeledgraph_gen_dst g e v') h rootpairs roots outlier.
proof: Proof. intros. destruct H as [? [? [? ?]]]. split; [|split; [|split]]. - apply lgd_graph_thread_info_compatible; assumption. - destruct H1. apply lgd_fun_thread_arg_compatible; assumption. - apply lgd_roots_compatible; assumption. - apply lgd_outlier_compatible; 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