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

# lpt0 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, lpt1[m1] = mklp(m2, # buf0, LP_INDEX_NODES, m5), istore[m1] = indexblock(indx, lax, m2), avol[m1] = mapped(buf0), keyset(gch) = gc-heap(lpt1, log1), pstate = index(m1), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, m1 < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore2, 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, gstore1), freelist-cons(lpt1, freelist), inv(gstore2 \ ginval), inv(gstore1), inv(istore), inv(istore0), inv(indexblock(indx, lax, m2)), 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[m1, mklp(m2, LEB_SIZE, LP_INDEX_NODES, m5)], lpt0, log1), lpt-ram-flash(lpt1, lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, ⌊err1⌋ , ¬ dups(log1), isbuf1 → synced(avol) ⊦ ∃ m, err. (¬ @(pstate.lnum, m, # buf1) ∈ istore ∧ err = ESUCCESS ∨ ⌊err⌋ ) ∧ ⟨adr := @(pstate.lnum, m, # buf1), err0 := err; if err0 = ESUCCESS then {istore[pstate.lnum].indlist := istore[pstate.lnum].indlist + ind '; istore[pstate.lnum].ladrlist := istore[pstate.lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-istore(avol, lpt1[m1, mklp(m2, LEB_SIZE, LP_INDEX_NODES, m5)], istore) ∧ (isbuf1 → synced(avol)) ∧ pstate = readonly ∧ adr2 = adr ∧ err1 = err0)

User applied rule exists right

And obtained the following new goals

Proof step 243:
# lpt1 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt0 = # avol, avol[m1] = mapped(buf0), istore[m1] = indexblock(indx, lax, m2), lpt1[m1] = mklp(m2, # buf0, LP_INDEX_NODES, m5), keyset(gch) = gc-heap(lpt1, log1), pstate = index(m1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore1) = gstore1, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, ginval < # avol, m1 < # avol, abs-gstore(avol, lpt1, gstore2, 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, gstore1), freelist-cons(lpt1, freelist), inv(indexblock(indx, lax, m2)), inv(istore0), inv(istore), inv(gstore1), inv(gstore2 \ ginval), 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), lpt-ram-flash(lpt1[m1, mklp(m2, LEB_SIZE, LP_INDEX_NODES, m5)], lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, ⌊err1⌋ , isbuf1 → synced(avol) ⊦ (¬ @(pstate.lnum, adr2.pos, # buf1) ∈ istore ∧ err1 = ESUCCESS ∨ ⌊err1⌋ ) ∧ ⟨adr := @(pstate.lnum, adr2.pos, # buf1), err0 := err1; if err0 = ESUCCESS then {istore[pstate.lnum].indlist := istore[pstate.lnum].indlist + ind '; istore[pstate.lnum].ladrlist := istore[pstate.lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; isbuf1 := ?⟩ ( abs-istore(avol, lpt1[m1, mklp(m2, LEB_SIZE, LP_INDEX_NODES, m5)], istore) ∧ (isbuf1 → synced(avol)) ∧ pstate = readonly ∧ adr2 = adr ∧ err1 = err0), dups(log1)

Rule argument

pos: right 1 terms: adr2.pos, err1 abort: F discard: T computed: F

Additional information

Used terms: adr2.pos, err1