[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 41 from proof inv-allocate-ind (previous step)

# lpt0 = # avol, # lpt0 = # avol0, # lpt1 = # avol0, lpt1[n0] = mklp(0, m1, LP_FREE, m2), avol = avol0[n0, mapped(mkbuf(0))], err = err0, err = ESUCCESS, freelist = freelist0.tail, freelist0 = n0 ' + nx0, keyset(gch) = gc-heap(lpt1, log0), n = n0, n0 < # avol0, awbuf-inv(avol, bleb), awbuf-inv(avol0, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol0), bufs-log-only(bleb, log0, lpt1), freelist-cons(lpt1, n0 ' + nx0), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), synced(avol0), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0; isbuf1 := false; if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr, m, log0, avol, lpt0, ns, isbuf1; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt1[n].flags := LP_INDEX_NODES}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb)), buffered(n0) = bleb, freelist0 = []

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 42:
# lpt1 = # avol0, # lpt0 = # avol0, # lpt0 = # avol, lpt1[n0] = mklp(0, m1, LP_FREE, m2), avol = avol0[n0, mapped(mkbuf(0))], err = ESUCCESS, err = err0, freelist = freelist0.tail, freelist0 = n0 ' + nx0, keyset(gch) = gc-heap(lpt1, log0), n = n0, n < # lpt1, n0 < # avol0, awbuf-inv(avol0, bleb), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol0), bufs-log-only(bleb, log0, lpt1), freelist-cons(lpt1, n0 ' + nx0), log-group-block(log0, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log0), synced(avol0), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪lpt1 := lpt1[n, mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx)] [n, lpt1[n, mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx)][n].ref-size:= 0 ]; isbuf1 := false; if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr, m, log0, avol, lpt0, ns, isbuf1; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt1[n].flags := LP_INDEX_NODES}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb)), buffered(n0) = bleb, freelist0 = []

Rule argument

Additional information

Used simplifier rules: ⊦ # avol[n, aleb] = # avol; (s)% ⊦ n ' + nx ≠ []; (s)%a: ⊦ (nx + nx0) + nx1 = nx + nx0 + nx1; from specification list[nat-list-set]% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)%fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat% ⊦ m < n → n ≠ 0; (s)% ⊦ ¬ n < n; (s)