[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 348 from proof refine-write (previous step)

⟨fail_or_success#(; ; err)⟩ (err = err1), # apebs = # wlar, apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), wlar[n4] = wl-entry(m1, used), avols[v][vtblpnum3] = mapped(buf2, m), vols[v][vtblpnum3] = ⌜n4⌝ , avols[v, avols[v][vtblpnum, mapped(subarray(buf, 0, n) + mkempbuf(LEB_SIZE - n), n)]] = avols0, buf = subarray(copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5), 0, vtblpnum5) + subarray(buf0, n3, n0) + subarray (copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5), vtblpnum5 + n0, # copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5) - vtblpnum5 - n0), err1 = ESUCCESS, err1 = err2, n = vtblpnum5 + n0, vtblpnum = vtblpnum3, avhdr.valid?, aehdr.valid?, vtblpnum3 < # avols[v], n4 < # wlar, vtblpnum3 < # vols[v], vtblpnum < # avols[v], abs(avols0, apebs0, vols0, q0), abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(n0, EB_PAGE_SIZE), is-aligned(vtblpnum5, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ vols, v ∈ avols, vtblpnum5 + n0 ≤ LEB_SIZE, m0 ≤ vtblpnum5, m ≤ vtblpnum5, n0 + n3 ≤ # buf0, m0 ≤ LEB_SIZE, m ≤ LEB_SIZE, vtblpnum5 ≤ LEB_SIZE, 0 + vtblpnum5 ≤ # copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5), n3 + n0 ≤ # buf0, (vtblpnum5 + n0) + (# copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5) - vtblpnum5 - n0) ≤ # copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5), 0 + vtblpnum5 ≤ # buf2, 0 + vtblpnum5 ≤ # mkbuf(vtblpnum5 + n0), 0 + n ≤ # buf, # copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5) - vtblpnum5 ≥ n0, # copy(buf2, 0, mkbuf(vtblpnum5 + n0), 0, vtblpnum5) ≥ vtblpnum5, LEB_SIZE ≥ n, ⌊err3⌋ ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then if avols[v][vtblpnum3].mapped? then if n0 ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n0) + mkempbuf(LEB_SIZE - vtblpnum5 - n0), vtblpnum5 + n0) else avols[v][vtblpnum3] := mapped(mkempbuf(vtblpnum5) + subarray(buf0, n3, n0) + mkempbuf(LEB_SIZE - vtblpnum5 - n0), vtblpnum5 + n0) else if avols[v][vtblpnum3].mapped? then choose n1 with n1 < n0 ∧ is-aligned(n1, EB_PAGE_SIZE) in if n1 ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n1) + mkempbuf(LEB_SIZE - vtblpnum5 - n1), vtblpnum5 + n1) ifnone skip else if n0 ≠ 0 then avols[v][vtblpnum3] := unmapped⟩ (abs(avols, apebs0, vols0, q0) ∧ err2 = err), n0 = 0, vtblpnum4 = n4, VTBL_VOLID ∈ vols

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 349:
⟨fail_or_success#(; ; err)⟩ (err = ESUCCESS), # apebs = # wlar, vols[v][vtblpnum3] = ⌜n4⌝ , avols[v][vtblpnum3] = mapped(buf2, m), wlar[n4] = wl-entry(m1, used), apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), n0 ≠ 0, vtblpnum4 ≠ n4, aehdr.valid?, avhdr.valid?, vtblpnum3 < # vols[v], n4 < # wlar, vtblpnum3 < # avols[v], abs(avols, apebs, vols, q), abs (avols[v, avols[v][vtblpnum3, mapped((subarray(buf2, 0, vtblpnum5) + subarray(buf0, n3, n0)) + mkempbuf(LEB_SIZE - vtblpnum5 + n0), vtblpnum5 + n0)]], apebs0, vols0, q0), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(vtblpnum5, EB_PAGE_SIZE), is-aligned(n0, EB_PAGE_SIZE), ubi-io-inv(apebs), ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf2, m0, false)), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols, n3 + n0 ≤ # buf0, vtblpnum5 ≤ LEB_SIZE, m ≤ LEB_SIZE, m0 ≤ LEB_SIZE, n0 + n3 ≤ # buf0, m ≤ vtblpnum5, m0 ≤ vtblpnum5, vtblpnum5 + n0 ≤ LEB_SIZE, ⌊err3⌋ , ¬ VTBL_VOLID ∈ vols ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then if avols[v][vtblpnum3].mapped? then if n0 ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n0) + mkempbuf(LEB_SIZE - vtblpnum5 - n0), vtblpnum5 + n0) else avols[v][vtblpnum3] := mapped(mkempbuf(vtblpnum5) + subarray(buf0, n3, n0) + mkempbuf(LEB_SIZE - vtblpnum5 - n0), vtblpnum5 + n0) else if avols[v][vtblpnum3].mapped? then choose n1 with n1 < n0 ∧ is-aligned(n1, EB_PAGE_SIZE) in if n1 ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf0, n3, n1) + mkempbuf(LEB_SIZE - vtblpnum5 - n1), vtblpnum5 + n1) ifnone skip else if n0 ≠ 0 then avols[v][vtblpnum3] := unmapped⟩ (abs(avols, apebs0, vols0, q0) ∧ ESUCCESS = err)

Rule argument

Additional information

Used simplifier rules: # buf = n ⊦ subarray(buf, 0, n) = buf; (s)% ⊦ m + n = m + n0 ↔ n = n0; (s)%⊦ v ∈ avols ∧ m < # avols[v] ∧ avols[v][m] = mapped(buf, n) ∧ ebm-cons(avols) → # buf = LEB_SIZE; (s)% ⊦ # subarray(buf, m, n) = n; (s)% ⊦ #(buf + buf0) = # buf + # buf0; (s)%append-a: ⊦ (buf + buf0) + buf1 = buf + buf0 + buf1; from specification array-splice[buffer]% ⊦ buf + mkbuf(0) = buf; (s)% ⊦ subarray(buf, n, 0) = mkbuf(0); (s)%n1 + n2 ≤ m0, m0 + m1 ≤ # buf ⊦ subarray(copy(buf0, n0, buf, n1, n2), m0, m1) = subarray(buf, m0, m1); (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)% ⊦ m - m = 0; (s)%m1 + n ≤ # buf ⊦ subarray(copy(buf0, m0, buf, m1, n), m1, n) = subarray(buf0, m0, n); (s)% ⊦ ¬ m + n < m; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ n + 0 = n; (s)% ⊦ m ≤ m; (s)% ⊦ m + n - m = n; (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m ≤ m + n; (s)% ⊦ # mkbuf(n) = n; (s)% ⊦ # copy(buf, m, buf0, m0, n) = # buf0; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)