Proof step 12 from proof inv-io-save (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

• Proof step 13:

  zh[r] = mkznode(r0, zbrar, boolvar, true, m0), adr = adr0, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, istore = istore2, istore0 = istore3, maxino = maxino0, pstate = index(m), remove-refsize0(istore2) = istore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, ((btree(rp, r, adr1, height, dirty, ri, nodes(istore3), as, alladrs, ok) * P))(zh), btree-sub-clean(r, m0, zh), inv(istore2), inv(istore3), inv(gstore1), inv(gstore2 \ ginval2), refsize-cons(istore3, as0 ∪ as), m ∈ istore3, r ∈ zh, n ≤ LEB_SIZE, as ⊆ alladrs, as ⊆ dom nodes(istore3), alladrs ⊆ dom nodes(istore3), as0 ⊆ dom nodes(istore3), istore2 ⊑ istore3, height = 0 → as = ∅ ⊦ ⟪n0 := n; pstate := index(m); istore1 := istore3; ind := save(mkznode(r0, zbrar, boolvar, true, m0)); gstore0 := gstore2; if n0 < ind.flashsize then {apersistence_sync#(adr0, istore3, istore2, ginval2, gstore0, gstore1, nx, maxino0, ginval; pstate, syn; err); if err = ESUCCESS then apersistence_allocate_ind#(adr0, istore2, ginval2, gstore0, gstore1, nx, maxino0, ginval, syn; istore3, pstate; err)} else err := ESUCCESS; adr := adr1; if err = ESUCCESS then {apersistence_add_ind#(ind, adr0, istore2, ginval2, gstore0, gstore1, nx, maxino0, ginval; adr, istore3, pstate, syn; err); if err = ESUCCESS then let maxino = 0 in {apersistence_get_iblock_refsize# (adr.lnum, adr0, istore3, istore2, ginval2, gstore0, gstore1, nx, maxino0, ginval, pstate, syn; ; maxino); apersistence_set_iblock_refsize# (adr.lnum, maxino + adr.size, adr0, istore2, ginval2, gstore0, gstore1, nx, maxino0, ginval, pstate, syn; istore3)}}; if err = ESUCCESS then zh[r].dirty := false⟫ ( refsize-cons(istore3, as0 ∪ (err = ESUCCESS ⊃ as ++ adr;as)) ∧ inv(istore3) ∧ istore2 ⊑ istore3 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore3) ∧ (pstate = unbuffered → syn) ∧ istore1 ⊑ istore3 ∧ r ∈ zh ∧ (err = ESUCCESS → ¬ adr ∈ as) ∧ dom nodes(istore3) = dom nodes(istore1) ∪ (err = ESUCCESS ⊃ ∅ ++ adr;∅) ∧ (err = ESUCCESS → ¬ adr ∈ istore1) ∧ (( btree (rp, r, (err = ESUCCESS ⊃ adr;adr1), height, err ≠ ESUCCESS, ri, nodes(istore3), (err = ESUCCESS ⊃ as ++ adr;as), (err = ESUCCESS ⊃ (alladrs -- adr1) ++ adr;alladrs), ok) * P) )(zh) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → pstate.index? ∧ ¬ zh[r].dirty)), dups(nx), adr1 ∈ as

• Proof step 268:

  zh[r] = mkznode(r0, zbrar, boolvar, true, m0), adr = adr0, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, istore = istore2, istore0 = istore3, maxino = maxino0, pstate = index(m), remove-refsize0(istore2) = istore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, ((btree(rp, r, adr1, height, dirty, ri, nodes(istore3), as, alladrs, ok) * P))(zh), btree-sub-clean(r, m0, zh), inv(istore2), inv(istore3), inv(gstore1), inv(gstore2 \ ginval2), refsize-cons(istore3, as0 ∪ as), m ∈ istore3, r ∈ zh, as ⊆ alladrs, as ⊆ dom nodes(istore3), alladrs ⊆ dom nodes(istore3), as0 ⊆ dom nodes(istore3), istore2 ⊑ istore3, height = 0 → as = ∅ ⊦ dups(nx), adr1 ∈ as, ∃ n. n ≤ LEB_SIZE

Rule argument

Additional information