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

⟨ebm_write#(v, vtblpnum2, 0, 0, 0, mkbuf(0); avols; err2)⟩ (avols = avols0 ∧ err2 = err1), # apebs = # wlar, vols[v][vtblpnum2] = unmapped, vtblpnum2 < # vols[v], vtblpnum2 < # avols[v], abs(avols, apebs, vols, q), abs(avols0, apebs0, vols0, q0), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum3), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum3), valid-wl(apebs, wlar), v ∈ vols, v ∈ avols ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avols[v][vtblpnum2] := mapped(emptyleb, 0)⟩ (abs(avols, apebs0, vols0, q0) ∧ err1 = err), avols[v][vtblpnum2].mapped?, VTBL_VOLID ∈ vols

Heuristic nonrecursive calls applied rule call left

And obtained the following new goals

Proof step 20:
⟨if v ∈ avols ∧ vtblpnum0 < # avols[v] ∧ vtblpnum + n0 ≤ LEB_SIZE ∧ is-aligned(vtblpnum, EB_PAGE_SIZE) ∧ is-aligned(n0, EB_PAGE_SIZE) ∧ n0 + n1 ≤ # buf ∧ (avols[v][vtblpnum0].mapped? → vtblpnum ≥ avols[v][vtblpnum0].fill) then {fail_or_success#(; ; err); if err = ESUCCESS then if avols[v][vtblpnum0].mapped? then if n0 ≠ 0 then avols[v][vtblpnum0] := mapped (subarray(avols[v][vtblpnum0].data, 0, vtblpnum) + subarray(buf, n1, n0) + mkempbuf(LEB_SIZE - vtblpnum - n0), vtblpnum + n0) else avols[v][vtblpnum0] := mapped(mkempbuf(vtblpnum) + subarray(buf, n1, n0) + mkempbuf(LEB_SIZE - vtblpnum - n0), vtblpnum + n0) else if avols[v][vtblpnum0].mapped? then choose n with n < n0 ∧ is-aligned(n, EB_PAGE_SIZE) in if n ≠ 0 then avols[v][vtblpnum0] := mapped (subarray(avols[v][vtblpnum0].data, 0, vtblpnum) + subarray(buf, n1, n) + mkempbuf(LEB_SIZE - vtblpnum - n), vtblpnum + n) ifnone skip else if n0 ≠ 0 then avols[v][vtblpnum0] := unmapped} else abort⟩ (avols = avols0 ∧ err = err1), # apebs = # wlar, vols[v][vtblpnum2] = unmapped, buf = mkbuf(0), n0 = 0, n1 = 0, vtblpnum = 0, vtblpnum0 = vtblpnum2, vtblpnum2 < # avols[v], vtblpnum2 < # vols[v], abs(avols0, apebs0, vols0, q0), abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum3), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum3), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err = ESUCCESS then avols[v][vtblpnum2] := mapped(emptyleb, 0)⟩ (abs(avols, apebs0, vols0, q0) ∧ err1 = err), avols[v][vtblpnum2].mapped?, VTBL_VOLID ∈ vols

Rule argument

pos: left 1

Additional information

Used simplifier rules: ebm_write#(VOLID, LNUM, OFFSET, N0, N, BUF; AVOLS; ERR) {if VOLID ∈ AVOLS ∧ LNUM < # AVOLS[VOLID] ∧ OFFSET + N ≤ LEB_SIZE ∧ is-aligned(OFFSET, EB_PAGE_SIZE) ∧ is-aligned(N, EB_PAGE_SIZE) ∧ N + N0 ≤ # BUF ∧ (AVOLS[VOLID][LNUM].mapped? → OFFSET ≥ AVOLS[VOLID][LNUM].fill) then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then if AVOLS[VOLID][LNUM].mapped? then if N ≠ 0 then AVOLS[VOLID][LNUM] := mapped ( subarray (AVOLS[VOLID][LNUM].data, 0, OFFSET) + subarray(BUF, N0, N) + mkempbuf(LEB_SIZE - OFFSET - N), OFFSET + N) else AVOLS[VOLID][LNUM] := mapped ( mkempbuf(OFFSET) + subarray(BUF, N0, N) + mkempbuf(LEB_SIZE - OFFSET - N), OFFSET + N) else if AVOLS[VOLID][LNUM].mapped? then choose N1 with N1 < N ∧ is-aligned(N1, EB_PAGE_SIZE) in if N1 ≠ 0 then AVOLS[VOLID][LNUM] := mapped ( subarray (AVOLS[VOLID][LNUM].data, 0, OFFSET) + subarray(BUF, N0, N1) + mkempbuf(LEB_SIZE - OFFSET - N1), OFFSET + N1) ifnone skip else if N ≠ 0 then AVOLS[VOLID][LNUM] := unmapped} else abort };