[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 4 from proof inv-get-gc-block (previous step)

# lpt = # avol, keyset(gch) = gc-heap(lpt, log), n = n0, n1 = n0, bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log, lpt), freelist-cons(lpt, freelist), log-group-block(log, lpt), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, log) ⊦ ⟪let empty? = ? in {gc_heap_is_empty#(gch; empty?); if empty? then err := ENOSPC else {gc_heap_get_min#(gch; n); err := ESUCCESS}}⟫ ((err = ENOSPC ∨ err = ESUCCESS) ∧ (err ≠ ESUCCESS → n = n1) ∧ (err = ESUCCESS → n < # avol ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ log)), dups(log)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Proof step 5:
# lpt = # avol, keyset(gch) = gc-heap(lpt, log), n = n0, n1 = n0, bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log, lpt), freelist-cons(lpt, freelist), log-group-block(log, lpt), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, log) ⊦ ⟪gc_heap_is_empty#(gch; empty?); if empty? then err := ENOSPC else {gc_heap_get_min#(gch; n); err := ESUCCESS}⟫ ((err = ENOSPC ∨ err = ESUCCESS) ∧ (err ≠ ESUCCESS → n = n1) ∧ (err = ESUCCESS → n < # avol ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ log)), dups(log)

Proof step 4 from proof inv-get-gc-block (previous step)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information