[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 15 from proof crash-neutral-add-ind (previous step)

istore1 = remove-refsize0(crash(istore, istore0)), remove-refsize0(istore0) = istore0, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(istore0), inv(istore), inv(gstore1), inv(gstore2 \ ginval1), m ∈ istore, istore0 ⊑ istore, ¬ dups(nx) ⊦ ∃ maxino, err. (¬ @(m, maxino, ind.flashsize) ∈ istore ∧ err = ESUCCESS ∨ ⌊err⌋ ) ∧ ⟨adr := @(index(m).lnum, maxino, ind.flashsize), err0 := err; if err0 = ESUCCESS then {istore[index(m).lnum].indlist := istore[index(m).lnum].indlist + ind '; istore[index(m).lnum].ladrlist := istore[index(m).lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; syn := ?⟩ (syn ∧ istore1 = remove-refsize0(crash(istore, istore0)))

User applied rule exists right

And obtained the following new goals

Proof step 16:
istore1 = remove-refsize0(crash(istore, istore0)), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore0) = istore0, elems nx ∩ ginval1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval1, inv(gstore2 \ ginval1), inv(gstore1), inv(istore), inv(istore0), m ∈ istore, istore0 ⊑ istore ⊦ (¬ @(m, 0, ind.flashsize) ∈ istore ∧ EIO = ESUCCESS ∨ ⌊EIO⌋ ) ∧ ⟨adr := @(index(m).lnum, 0, ind.flashsize), err0 := EIO; if err0 = ESUCCESS then {istore[index(m).lnum].indlist := istore[index(m).lnum].indlist + ind '; istore[index(m).lnum].ladrlist := istore[index(m).lnum].ladrlist + @(adr.pos, adr.size) '} else adr := ?, pstate := readonly; syn := ?⟩ (syn ∧ istore1 = remove-refsize0(crash(istore, istore0))), dups(nx)

Rule argument

pos: right 1 terms: 0, EIO abort: F discard: T computed: F

Additional information

Used terms: 0, EIO