| gstore[nx.last] = groupblock(gndx0, lax0, m), gndx = [], remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval1 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval1, inv(groupblock(gndx0, lax0, m)), inv(gstore0), inv(gstore \ ginval1), ri-inj(fi1), ri-inj(fi2), nx.last ∈ gstore ⊦ ∃ lax, err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ¬ dups(lax0 + lax) ∧ # lax ≤ # gndx ∧ inv-flashsize(prefixn(# lax, gndx), lax) ∧ (err0 = ESUCCESS ↔ # lax = # gndx) ∧ ⟨ax := lax.to-adr(nx.last), err := err0; gstore2 := gstore[nx.last, gstore[nx.last].gndlist:= (gndx0 + prefixn(# lax, gndx))]; gstore2[nx.last].ladrlist := gstore2[nx.last].ladrlist + lax; if err ≠ ESUCCESS then ax := ?; syn := ?⟩ (syn ∧ crash(gstore, gstore0, ginval1, nx) = crash(gstore2, gstore0, ginval1, nx)), nx = [], dups(nx) |
gstore[nx.last] = groupblock(gndx0, lax0, m), remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval1 = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval1, nx ≠ [], inv(gstore \ ginval1), inv(gstore0), inv(groupblock(gndx0, lax0, m)), ri-inj(fi2), ri-inj(fi1), nx.last ∈ gstore, ¬ dups(nx) ⊦ ⟨ax := [], err := ESUCCESS; gstore2 := gstore[nx.last, gstore[nx.last].gndlist:= gndx0]; gstore2[nx.last].ladrlist := gstore2[nx.last].ladrlist; if err ≠ ESUCCESS then ax := ?; syn := ?⟩ (syn ∧ crash(gstore, gstore0, ginval1, nx) = crash(gstore2, gstore0, ginval1, nx))
Used simplifier rules: ⊦ inv(groupblock(gndx, lax, m0)) → ¬ dups(lax); (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)%a: ⊦ (lax + lax0) + lax1 = lax + lax0 + lax1; from specification list[laddress-list]% ⊦ lax + [] = lax; (s)%a: ⊦ (gndx + gndx0) + gndx1 = gndx + gndx0 + gndx1; from specification list[group-store]% ⊦ gndx + [] = gndx; (s)% ⊦ ([]).to-adr(n) = []; (s)% ⊦ inv-flashsize([], lax) ↔ lax = []; (s)% ⊦ prefixn(0, gndx) = []; (s)% ⊦ # [] = 0; (s)% ⊦ # lax = 0 ↔ lax = []; (s)% ⊦ m ≤ 0 ↔ m = 0; (s)% ⊦ # [] = 0; (s)