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

# lpt1 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt0 = # avol, istore[m0] = indexblock(indx, lax, m4), lpt1[m0] = mklp(m4, # buf0, LP_INDEX_NODES, m2), avol[m0] = mapped(buf0), ¬ isbuf2, keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, m0 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol, buffered(m0)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m0), lpt1, avol), bufs-log-only(buffered(m0), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), inv(indexblock(indx, lax, m4)), 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), m0 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, ¬ dups(log1), isbuf1 → synced(avol) ⊦ [awbuf_write_buf#(# buf1, buf1, adr0, m, log1, lpt0, ns0, buffered(m0); avol, isbuf2; err)] ( awbuf-inv(avol, buffered(m0)) ∧ # lpt0 = # avol → [adr := adr2; if err = ESUCCESS then {adr := @(buffered(m0).leb, lpt1[buffered(m0).leb].size, # buf1); lpt1[buffered(m0).leb] := mklp (lpt1[buffered(m0).leb].ref-size, lpt1[buffered(m0).leb].size + # buf1, lpt1[buffered(m0).leb].flags, lpt1[buffered(m0).leb].gcheapidx)} else lpt1[buffered(m0).leb] := mklp(lpt1[buffered(m0).leb].ref-size, LEB_SIZE, lpt1[buffered(m0).leb].flags, lpt1[buffered(m0).leb].gcheapidx)] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(buffered(m0), log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf2, buffered(m0), lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) → ⟨pstate := index(m0); apersistence_add_ind#(ind, adr0, istore0, ginval, gstore, gstore0, log1, m, ns0; adr2, istore, pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ pstate ≠ unbuffered ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ readonly → m0 = pstate.lnum) ∧ adr = adr2 ∧ err = err0)))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 86:
# lpt0 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, isbuf ↔ isbuf2, avol[m1] = mapped(buf0), lpt1[m1] = mklp(m4, # buf0, LP_INDEX_NODES, m2), istore[m1] = indexblock(indx, lax, m4), adr = adr0, bleb = buffered(m1), buf = buf1, ¬ isbuf2, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, m0 = m, n0 = # buf1, ns = ns0, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, m1 < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol, buffered(m1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m1), lpt1, avol), bufs-log-only(buffered(m1), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(indexblock(indx, lax, m4)), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), 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), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, isbuf1 → synced(avol) ⊦ [if bleb ≠ nobuffer ∧ # avol[bleb.leb].data + n0 ≤ LEB_SIZE ∧ n0 ≤ # buf then if isbuf then err := EROFS else {fail_or_success#(; ; err); let m = bleb.leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n0)) else { choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) ifnone skip or skip; isbuf := true}} else abort] ( awbuf-inv(avol, buffered(m1)) ∧ # lpt0 = # avol → [adr := adr2; if err = ESUCCESS then {adr := @(buffered(m1).leb, lpt1[buffered(m1).leb].size, # buf1); lpt1[buffered(m1).leb] := mklp (lpt1[buffered(m1).leb].ref-size, lpt1[buffered(m1).leb].size + # buf1, lpt1[buffered(m1).leb].flags, lpt1[buffered(m1).leb].gcheapidx)} else lpt1[buffered(m1).leb] := mklp(lpt1[buffered(m1).leb].ref-size, LEB_SIZE, lpt1[buffered(m1).leb].flags, lpt1[buffered(m1).leb].gcheapidx)] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(buffered(m1), log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf, buffered(m1), lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) → ⟨pstate := index(m1); apersistence_add_ind#(ind, adr0, istore0, ginval, gstore, gstore0, log1, m, ns0; adr2, istore, pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ pstate ≠ unbuffered ∧ (pstate = readonly ↔ isbuf) ∧ (pstate ≠ readonly → m1 = pstate.lnum) ∧ adr = adr2 ∧ err = err0))), dups(log1)

Rule argument

pos: right 1

Additional information

Used simplifier rules: awbuf_write_buf# (N, BUF, WROOTADR, WMAXINO, WLOG, WLPT, WORPHANS, WBUFLEB ; WVOL, AROFS ; ERR ) {if WBUFLEB ≠ nobuffer ∧ # WVOL[WBUFLEB.leb].data + N ≤ LEB_SIZE ∧ N ≤ # BUF then if AROFS then ERR := EROFS else {fail_or_success#(; ; ERR); let LNUM = WBUFLEB.leb in if ERR = ESUCCESS then WVOL[LNUM] := mapped(WVOL[LNUM].data + subarray(BUF, 0, N)) else { choose N0 with N0 ≠ 0 ∧ N0 < N ∧ is-aligned (# WVOL[LNUM].data + N0, EB_PAGE_SIZE) in WVOL[LNUM] := mapped (WVOL[LNUM].data + subarray(BUF, 0, N0)) ifnone skip or skip; AROFS := true}} else abort };