[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 4 from proof crash-neutral-commit (previous step)

syn ↔ true, adr = adr3, adr0 = adr1, adr2 = adr3, ginval = ginval2, ginval0 = ginval6, ginval1 = ginval3, ginval4 = ginval6, ginval5 = ginval2, gstore = gstore3, gstore0 = gstore4, gstore1 = crash(gstore4, gstore3, ginval6, nx), gstore2 = gstore3, istore = istore3, istore0 = istore4, istore1 = remove-refsize0(crash(istore4, istore3)), istore2 = istore3, maxino = maxino3, maxino0 = maxino1, maxino2 = maxino3, nx0 = nx, remove-refsize0(istore3) = istore3, remove-refsize0(gstore3) = gstore3, elems nx ∩ ginval6 = ∅, dom remove-refsize0(gstore4) ∩ ginval6 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval6, inv(istore3), inv(istore4), inv(gstore3), inv(gstore4 \ ginval6), istore3 ⊑ istore4, pstate.index? → pstate.lnum ∈ istore4, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore4 ⊦ ⟨if syn ∧ dom remove-refsize0(gstore0) ∩ ginval0 = ∅ then {fail_or_success#(; ; err); if err = ESUCCESS then {istore0 := remove-refsize0(istore0); istore := istore0; gstore0 := remove-refsize0(gstore0); gstore := gstore0; ginval0 := ∅; adr := adr0; ginval := ginval1; nx := []; maxino := maxino0; pstate := unbuffered} else pstate := readonly; ginval1 := ?} else abort⟩ ( adr2 = adr ∧ istore1 = remove-refsize0(crash(istore0, istore)) ∧ istore2 = istore ∧ ginval4 = ginval0 ∧ gstore1 = crash(gstore0, gstore, ginval0, nx) ∧ gstore2 = gstore ∧ nx0 = nx ∧ maxino2 = maxino ∧ ginval5 = ginval), dups(nx)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information