proposition: Lemma heap_relation_size_spec: forall h1 h2 : heap, heap_relation h1 h2 -> ti_size_spec h1 -> ti_size_spec h2.
proof: Proof. intros. unfold ti_size_spec in *. rewrite Forall_forall in *. intros. specialize (H0 _ H1). unfold nth_gen_size_spec in *. destruct H as [H2 H3]. rewrite <- H2, <- H3. 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