[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 9 from proof crash-neutral-allocate-gnd (previous step)

remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, pstate ≠ readonly, inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), istore1 ⊑ istore2, ¬ dups(nx), pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore ⊦ ⟨fail_or_success#(; ; err); nx0 := nx; gstore1 := crash(gstore, gstore0, ginval, nx); ginval1 := ginval; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n, pstate := journal(n)⟩ (ginval1 = ginval ∧ gstore1 = crash(gstore, gstore0, ginval, nx) ∧ nx0 = nx)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 10:
remove-refsize0(gstore0) = gstore0, remove-refsize0(istore1) = istore1, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, inv(gstore \ ginval), inv(gstore0), inv(istore2), inv(istore1), istore1 ⊑ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore2 ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; nx0 := nx; gstore1 := crash(gstore, gstore0, ginval, nx); ginval1 := ginval; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n, pstate := journal(n)⟩ (ginval1 = ginval ∧ gstore1 = crash(gstore, gstore0, ginval, nx) ∧ nx0 = nx), pstate = readonly, dups(nx)

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};