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

# lpt2 = # avol, # lpt1 = # avol, adr = adr3, keyset(gch) = gc-heap(lpt2, log), log1 = log, maxino = m, ns = ns4, ns0 = ns2, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, dom remove-refsize0(gstore) ∩ ginval = ∅, elems log ∩ ginval = ∅, dom gstore0 ∪ elems log = dom gstore ∪ ginval, ginval < # avol, abs-gstore(avol, lpt2, gstore, ginval), abs-istore(avol, lpt2, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(true, bleb, lpt2, avol), bufs-log-only(bleb, log, lpt2), flash-lpt-cons(lpt1, istore0, gstore0), freelist-cons(lpt2, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log, lpt2), lpt-free-unref(lpt1), lpt-free-unref(lpt2), lpt-leb-size(lpt1), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt1, log), synced(avol), istore0 ⊑ istore, ¬ dups(log) ⊦ ⟨apersistence_commit#(adr2, m2, true; ns2, istore, ginval, gstore, adr3, istore0, gstore0, log1, maxino, ns4; pstate, err0)⟩ ( abs-istore(avol, lpt2, istore) ∧ abs-gstore(avol, lpt2, gstore, ginval) ∧ adr3 = adr ∧ maxino = m ∧ log1 = log ∧ ginval < # avol ∧ ns4 = ns ∧ flash-lpt-cons(lpt1, istore0, gstore0) ∧ pstate = readonly ∧ ns0 = ns2 ∧ EROFS = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 30:
# lpt1 = # avol, # lpt2 = # avol, isbuf ↔ true, adr = adr3, adr0 = adr2, adr1 = adr3, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt2, log0), log = log1, log1 = log0, m = m2, maxino = m0, ns = ns4, ns0 = ns2, ns1 = ns4, ns3 = ns2, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems log0 ∩ ginval = ∅, dom remove-refsize0(gstore2) ∩ ginval = ∅, dom gstore1 ∪ elems log0 = dom gstore2 ∪ ginval, ginval < # avol, abs-gstore(avol, lpt2, gstore2, ginval), abs-istore(avol, lpt2, istore2), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(true, bleb, lpt2, avol), bufs-log-only(bleb, log0, lpt2), flash-lpt-cons(lpt1, istore1, gstore1), freelist-cons(lpt2, freelist), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval), log-group-block(log0, lpt2), lpt-free-unref(lpt2), lpt-free-unref(lpt1), lpt-leb-size(lpt2), lpt-leb-size(lpt1), lpt-ram-flash(lpt2, lpt1, log0), synced(avol), istore1 ⊑ istore2 ⊦ ⟨if isbuf ∧ dom remove-refsize0(gstore0) ∩ ginval = ∅ then {fail_or_success#(; ; err); if err = ESUCCESS then {istore0 := remove-refsize0(istore0); istore := istore0; gstore0 := remove-refsize0(gstore0); gstore := gstore0; ginval := ∅; adr := adr0; ns := ns0; log := []; maxino := m; pstate := unbuffered} else pstate := readonly; ns0 := ?} else abort⟩ ( abs-istore(avol, lpt2, istore0) ∧ abs-gstore(avol, lpt2, gstore0, ginval) ∧ adr = adr1 ∧ maxino = m0 ∧ log = log0 ∧ ginval < # avol ∧ ns = ns1 ∧ flash-lpt-cons(lpt1, istore, gstore) ∧ pstate = readonly ∧ ns3 = ns0 ∧ EROFS = err), dups(log0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_commit# (ROOTADR0, MAXINO0, PSYNCED ; OS0, ISTORE, GINVAL, GSTORE, ROOTADR, ISTORE0, GSTORE0, NL, MAXINO, OS ; PSTATE, ERR ) {if PSYNCED ∧ dom remove-refsize0(GSTORE) ∩ GINVAL = ∅ then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then {ISTORE := remove-refsize0(ISTORE); ISTORE0 := ISTORE; GSTORE := remove-refsize0(GSTORE); GSTORE0 := GSTORE; GINVAL := ∅; ROOTADR := ROOTADR0; OS := OS0; NL := []; MAXINO := MAXINO0; PSTATE := unbuffered} else PSTATE := readonly; OS0 := ?} else abort };