[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 385 from proof refine-sync (previous step)

# lpt1 = # avol, # lpt0 = # avol, isbuf ↔ isbuf1, lpt1[pstate.lnum] = mklp(m1, # buf, lpf, m4), avol[pstate.lnum] = mapped(buf), adr = adr0, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt1, log1), log = log1, maxino = m, n = pstate.lnum, ns = ns0, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, ginval < # avol, pstate.lnum < # avol, abs-gstore(avol, lpt1, gstore2, ginval), abs-istore(avol, lpt1, istore2), awbuf-inv(avol, buffered(pstate.lnum)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(pstate.lnum), lpt1, avol), bufs-log-only(buffered(pstate.lnum), log1, lpt1), flash-lpt-cons(lpt0, istore1, gstore1), freelist-cons(lpt1, freelist), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval), is-aligned(# buf, 2 * NODE_HEADER_SIZE), 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), # buf ≤ LEB_SIZE, istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore2 ⊦ ⟨if pstate = unbuffered then err := ESUCCESS else {fail_or_success#(; ; err); isbuf := err = ESUCCESS; skip or pstate := readonly}⟩ (pstate ≠ unbuffered ∧ pstate ≠ readonly ∧ n = pstate.lnum ∧ ESUCCESS = err), lpf = LP_FREE, pstate = unbuffered, pstate = readonly, dups(log1)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information