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

# apebs = # wlar, # vols[v] = # avols[v], apebs[vols[v][vtblpnum].pnum] = mkpeb(aehdr, avhdr, buf1, m, boolvar), buf = buf0, vtblpnum < # avols[v], bflipset-cons(bflipset, wlar), ebm-cons(avols), ubi-io-inv(apebs), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum1), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum1), valid-wl(apebs, wlar), v ∈ avols, v ∈ vols, vtblpnum0 + n ≤ LEB_SIZE, n0 + n ≤ # buf0, avols[v][vtblpnum] = erased → ¬ v × vtblpnum ∈ q, vols[v][vtblpnum] ≠ unmapped → avols[v][vtblpnum].mapped? ∧ avols[v][vtblpnum].data = buf1 ∧ m ≤ avols[v][vtblpnum].fill, vols[v][vtblpnum] = unmapped → ¬ avols[v][vtblpnum].mapped? ⊦ ⟪ubi_read#(v, vtblpnum, vtblpnum0, n0, n, vols, LEB_SIZE, apebs; buf, bflipset; err)⟫ ⟨ebm_read#(v, vtblpnum, vtblpnum0, n0, n, avols; buf0; err0)⟩ (buf = buf0 ∧ err = err0), VTBL_VOLID ∈ vols

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 11:
# vols[v] = # avols[v], # apebs = # wlar, apebs[vols[v][vtblpnum].pnum] = mkpeb(aehdr, avhdr, buf1, m, boolvar), buf = buf0, vtblpnum0 = LEB_SIZE, vtblpnum1 = vtblpnum4, vtblpnum2 = vtblpnum, vtblpnum < # avols[v], 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, n0 + n ≤ # buf0, vtblpnum4 + n ≤ LEB_SIZE, vols[v][vtblpnum] = unmapped → ¬ avols[v][vtblpnum].mapped?, vols[v][vtblpnum] ≠ unmapped → avols[v][vtblpnum].mapped? ∧ avols[v][vtblpnum].data = buf1 ∧ m ≤ avols[v][vtblpnum].fill, avols[v][vtblpnum] = erased → ¬ v × vtblpnum ∈ q ⊦ ⟪if v ∈ vols ∧ vtblpnum2 < # vols[v] ∧ vtblpnum1 + n ≤ vtblpnum0 ∧ n0 + n ≤ # buf then let ebae = vols[v][vtblpnum2] in if ebae = unmapped then {buf := fill(buf, empty, n0, n); err := ESUCCESS} else let vtblpnum = ebae.pnum, bitflips = ? in {aubi_io_read_data#(vtblpnum, vtblpnum1, n0, n, apebs; buf; bitflips, err); if err = ESUCCESS ∧ bitflips then bflipset := bflipset ++ vtblpnum} else abort⟫ ⟨ebm_read#(v, vtblpnum, vtblpnum4, n0, n, avols; buf0; err0)⟩ (buf = buf0 ∧ err = err0), VTBL_VOLID ∈ vols

Rule argument

pos: right 1

Additional information

Used simplifier rules: ubi_read# (VOLID, LNUM, OFFSET, N0, N, VOLS, LEBSIZE, APEBS; BUF, BFLIPSET; ERR) {if VOLID ∈ VOLS ∧ LNUM < # VOLS[VOLID] ∧ OFFSET + N ≤ LEBSIZE ∧ N0 + N ≤ # BUF then let EBAENT = VOLS[VOLID][LNUM] in if EBAENT = unmapped then {BUF := fill(BUF, empty, N0, N); ERR := ESUCCESS} else let PNUM = EBAENT.pnum, BITFLIPS = ? in {aubi_io_read_data# (PNUM, OFFSET, N0, N, APEBS; BUF; BITFLIPS, ERR); if ERR = ESUCCESS ∧ BITFLIPS then BFLIPSET := BFLIPSET ++ PNUM} else abort };