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

# apebs0 = # wlar0, # apebs = # wlar, LEB_SIZE = (n2 + vtblpnum5) + n, apebs0[n3] = mkpeb(aehdr, avhdr, buf0, m, boolvar), vols[v][vtblpnum3] = unmapped, vtblpnum3 < # vols[v], vtblpnum3 < # avols[v], abs(avols, apebs, vols, q), abs(avols, apebs0, vols, q), bflipset-cons(bflipset, wlar0), bflipset-cons(bflipset, wlar), ebm-cons(avols), id(apebs0, apebs, mapped-pebs(vols)), is-aligned(n, EB_PAGE_SIZE), is-aligned(vtblpnum5, EB_PAGE_SIZE), ubi-io-inv(apebs0), ubi-io-inv(apebs), unique-sqns(apebs0), unique-sqns(apebs), valid-ebatbl(apebs0, wlar0, vols0, vtblpnum4), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(q0), valid-eraseq(wlar0, q0), valid-eraseq(apebs0, q0), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs0, sqnum0), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs0, vols0, wlar0, vtblpnum4), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs0, wlar0), valid-wl(apebs, wlar), v ∈ vols, v ∈ avols, n ≤ LEB_SIZE, n + n4 ≤ # buf, n4 + n ≤ # buf, vtblpnum5 + n ≤ LEB_SIZE, q0.lebrefs ⊆ q.lebrefs ++ (v × vtblpnum3), ¬ avols[v][vtblpnum3].mapped?, ¬ VTBL_VOLID ∈ vols, ¬ VTBL_VOLID ∈ vols0, n = 0 → q0.lebrefs ⊆ q.lebrefs, err1 ≠ ESUCCESS → vols0 = vols, err1 = ESUCCESS → vols0 = vols[v, vols[v][vtblpnum3, ⌜n3⌝ ]] ∧ (n ≠ 0 → m = vtblpnum5 + n) ∧ (n = 0 → m = 0) ∧ buf0 = mkempbuf(vtblpnum5) + subarray(buf, n4, n) + mkempbuf(n2), err1 = ESUCCESS ∨ ⌊err1⌋ ⊦ (⌊err1⌋ ∨ err1 = ESUCCESS) ∧ ⟨err := err1; if err = ESUCCESS then if avols[v][vtblpnum3].mapped? then if n ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf, n4, n) + mkempbuf(LEB_SIZE - vtblpnum5 - n), vtblpnum5 + n) else avols[v][vtblpnum3] := mapped(mkempbuf(vtblpnum5) + subarray(buf, n4, n) + mkempbuf(LEB_SIZE - vtblpnum5 - n), vtblpnum5 + n) else if avols[v][vtblpnum3].mapped? then choose n1 with n1 < n ∧ is-aligned(n1, EB_PAGE_SIZE) in if n1 ≠ 0 then avols[v][vtblpnum3] := mapped (subarray(avols[v][vtblpnum3].data, 0, vtblpnum5) + subarray(buf, n4, n1) + mkempbuf(LEB_SIZE - vtblpnum5 - n1), vtblpnum5 + n1) ifnone skip else if n ≠ 0 then avols[v][vtblpnum3] := unmapped⟩ (abs(avols, apebs0, vols0, q0) ∧ err1 = err)

Heuristic dl case distinction applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information