fact: Definition linked_correctly' (contents : list heap_item) (lookup : list Z) (offset : Z) : Prop := NoDup lookup /\ forall i, 0 <= i < Zlength contents -> let loc := heap_item_key (Znth i contents) in 0 <= loc < Zlength lookup /\ Znth loc lookup = offset + i.
imports: RelationClasses VST.floyd.proofauto CertiGraph.lib.List_ext CertiGraph.binheap.binary_heap_pro CertiGraph.binheap.binary_heap_malloc_spec CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel