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

zh[rp] = mkznode(r, zbrar, boolvar, boolvar0, m), adr = adr3, err1 = err, err1 = ESUCCESS, ginval0 = ginval4, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval4 = ∅, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr3, istore2, istore1, zh, ri, fi), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval4), istore1 ⊑ istore2, ⌊err⌋ ∨ err = ESUCCESS ⊦ [adr := adr3; ginval := ginval1; nx := []; maxino := maxino0; pstate := unbuffered; ginval1 := ?] ( inv(remove-refsize0(gstore0) \ ∅) ∧ inv(remove-refsize0(gstore0)) ∧ elems nx ∩ ∅ = ∅ ∧ ¬ dups(nx) ∧ dom remove-refsize0(gstore0) ∪ elems nx = dom remove-refsize0(gstore0) ∪ ∅ ∧ remove-refsize0(remove-refsize0(gstore0)) = remove-refsize0(gstore0) ∧ inv(remove-refsize0(istore0)) ∧ inv(remove-refsize0(istore0)) ∧ remove-refsize0(istore0) ⊑ remove-refsize0(istore0) ∧ remove-refsize0(remove-refsize0(istore0)) = remove-refsize0(istore0) ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ remove-refsize0(gstore0)) ∧ (pstate.index? → pstate.lnum ∈ remove-refsize0(istore0)) → ⟪syn0 := true; adr0 := adr; maxino2 := maxino, gstore1 := remove-refsize0(gstore0), gstore2 := remove-refsize0(gstore0), ginval4 := ∅, istore1 := remove-refsize0(istore0), istore2 := remove-refsize0(istore0); if err1 = ESUCCESS then adr := adr3 else if false then {zh[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (adr3.lnum, adr0, istore2, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate, syn0; ; maxino); apersistence_set_iblock_refsize# (adr3.lnum, maxino - adr3.size, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate, syn0; istore2)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore2, istore1, zh, ri, fi)) ∧ inv(istore2) ∧ istore1 ⊑ istore2 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore2) ∧ (pstate = unbuffered → syn0))), dups(nx), rp ≠ null ∧ boolvar0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information