proposition: Lemma reset_heap_overflow: forall n h, length (spaces h) <= n -> reset_nth_heap n h = h.
proof: Proof. intros. unfold reset_nth_heap. destruct h. simpl in *. assert (spaces0 = reset_nth_space n spaces0) by (rewrite reset_nth_space_overflow; [reflexivity | assumption]). apply EqdepFacts.f_eq_dep_non_dep, EqdepFacts.eq_dep1_dep. apply (EqdepFacts.eq_dep1_intro _ _ _ _ _ _ H0). apply proof_irr. 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