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

# lpt0 = # avol, # lpt1 = # avol, lpt1[n0] = mklp(0, m1, LP_FREE, m2), keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, pstate ≠ readonly, n0 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), synced(avol), istore0 ⊑ istore, ¬ dups(log1), pstate ≠ unbuffered → bleb = buffered(pstate.lnum), pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate = unbuffered → bleb = nobuffer ⊦ ⟪awbuf_remap#(n0, adr0, m, log1, lpt0, ns0, bleb, false; avol; err); n := n0; freelist := n0 ' + nx0; if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}; if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr0, m, log1, avol, lpt0, ns0, pstate = readonly; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt1[n].flags := LP_INDEX_NODES}⟫ ⟨pstate0 := pstate; apersistence_allocate_ind#(adr0, istore0, ginval, gstore, gstore0, log1, m, ns0, true; istore, pstate; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 57:
# lpt1 = # avol, # lpt0 = # avol, isbuf ↔ false, lpt1[n0] = mklp(0, m1, LP_FREE, m2), adr = adr0, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, m0 = n0, ns = ns0, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, n0 < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log1), synced(avol), istore0 ⊑ istore, pstate = unbuffered → bleb = nobuffer, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore, pstate ≠ unbuffered → bleb = buffered(pstate.lnum) ⊦ ⟪if synced(avol) ∧ m0 < # avol ∧ buffered(m0) ≠ bleb then {fail_or_success#(; ; err); if err = ESUCCESS then avol[m0] := mapped(mkbuf(0)) else {skip or avol[m0] := unmapped}} else abort; n := n0; freelist := n0 ' + nx0; if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}; if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr0, m, log1, avol, lpt0, ns0, pstate = readonly; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt1[n].flags := LP_INDEX_NODES}⟫ ⟨pstate0 := pstate; apersistence_allocate_ind#(adr0, istore0, ginval, gstore, gstore0, log1, m, ns0, true; istore, pstate; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err0), pstate = readonly, dups(log1)

Rule argument

pos: right 1

Additional information

Used simplifier rules: awbuf_remap# (LNUM, WROOTADR, WMAXINO, WLOG, WLPT, WORPHANS, WBUFLEB, AROFS ; WVOL ; ERR ) {if synced(WVOL) ∧ LNUM < # WVOL ∧ buffered(LNUM) ≠ WBUFLEB then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then WVOL[LNUM] := mapped(mkbuf(0)) else {skip or WVOL[LNUM] := unmapped}} else abort };