[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 6 from proof prepost-create-gcheap (previous step)

log = nx, lpt0 = lpt, n = 0 ⊦ ⟪gch := bin-heap(mkkeyarray(1), 0); while n < # lpt do {/* (prepost-create-gcheap : invariant n ≤ # lpt ∧ bin-heap-inv(gch, lpt) ∧ gc-heap(lpt, log, n) = keyset(gch) ∧ id-idx(lpt`, lpt) wfbound # lpt - n) */; if lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ log then let ki = key-index(lpt[n].ref-size, n) in gc_heap_insert#(ki; gch, lpt); n := n + 1}⟫ (bin-heap-inv(gch, lpt) ∧ gc-heap(lpt0, nx) = keyset(gch) ∧ id-idx(lpt0, lpt))

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 7:
gch = bin-heap(mkkeyarray(1), 0), log = nx, lpt0 = lpt, n = 0 ⊦ ⟪while n < # lpt do {/* (prepost-create-gcheap : invariant n ≤ # lpt ∧ bin-heap-inv(gch, lpt) ∧ gc-heap(lpt, log, n) = keyset(gch) ∧ id-idx(lpt`, lpt) wfbound # lpt - n) */; if lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ log then let ki = key-index(lpt[n].ref-size, n) in gc_heap_insert#(ki; gch, lpt); n := n + 1}⟫ (bin-heap-inv(gch, lpt) ∧ gc-heap(lpt0, nx) = keyset(gch) ∧ id-idx(lpt0, lpt))

Proof step 6 from proof prepost-create-gcheap (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information