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

# apebs = # wlar, wlar[n4] = wl-entry(m1, used), avols[v][vtblpnum3] = mapped(buf2, m), vols[v][vtblpnum3] = ⌜n4⌝ , apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), buf1 = mkbuf(vtblpnum5 + n), n ≠ 0, vtblpnum4 ≠ n4, avhdr.valid?, aehdr.valid?, n4 < # wlar, vtblpnum3 < # avols[v], vtblpnum3 < # vols[v], abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(n, 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 ∈ avols, v ∈ vols, m0 ≤ vtblpnum5, m ≤ vtblpnum5, n + n3 ≤ # buf, n3 + n ≤ # buf, vtblpnum5 + n ≤ LEB_SIZE, ⌊err0⌋ , ¬ VTBL_VOLID ∈ vols ⊦ ⟪aubi_io_read_data#(vols[v][vtblpnum3].pnum, 0, 0, vtblpnum5, apebs; buf1; bitflips, err0); if err0 = ESUCCESS then {buf1 := copy(buf, n3, buf1, vtblpnum5, n); debug#("ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString); ubi_change#(v, vtblpnum3, vtblpnum5 + n, buf1, EB_PAGE_SIZE; vols, wlar, q, bflipset, vtblpnum4, sqnum, apebs; err0)} else debug#("ubi: failed to read data from PEB " + vols[v][vtblpnum3].pnum.toString)⟫ ⟨ebm_write#(v, vtblpnum3, vtblpnum5, n3, n, buf; avols; err1)⟩ (abs(avols, apebs, vols, q) ∧ err0 = err1)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 310:
# apebs = # wlar, apebs[n4] = mkpeb(aehdr, avhdr, buf2, m0, false), vols[v][vtblpnum3] = ⌜n4⌝ , avols[v][vtblpnum3] = mapped(buf2, m), wlar[n4] = wl-entry(m1, used), buf0 = buf1, buf1 = mkbuf(vtblpnum5 + n1), n = vtblpnum5, n0 = 0, vtblpnum = 0, vtblpnum0 = vols[v][vtblpnum3].pnum, aehdr.valid?, avhdr.valid?, vtblpnum3 < # vols[v], vtblpnum3 < # avols[v], n4 < # wlar, abs(avols, apebs, vols, q), bflipset-cons(bflipset, wlar), ebm-cons(avols), is-aligned(vtblpnum5, EB_PAGE_SIZE), is-aligned(n1, 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 ∈ vols, v ∈ avols, vtblpnum5 + n1 ≤ LEB_SIZE, n3 + n1 ≤ # buf, n1 + n3 ≤ # buf, m ≤ vtblpnum5, m0 ≤ vtblpnum5, ⌊err0⌋ ⊦ ⟪if ubi-io-read-data-pre(vtblpnum0, vtblpnum, n0, n, buf0, apebs) then {fail_or_success#(; ; err); bitflips := ?; if err = ESUCCESS then buf0 := copy(apebs[vtblpnum0].data, vtblpnum, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n0) ∧ range=(buf, n0 + n, buf0, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort; err0 := err, buf1 := buf0; if err0 = ESUCCESS then {buf1 := copy(buf, n3, buf1, vtblpnum5, n1); debug#("ubi: moving data from PEB " + vols[v][vtblpnum3].pnum.toString); ubi_change#(v, vtblpnum3, vtblpnum5 + n1, buf1, EB_PAGE_SIZE; vols, wlar, q, bflipset, vtblpnum4, sqnum, apebs; err0)} else debug#("ubi: failed to read data from PEB " + vols[v][vtblpnum3].pnum.toString)⟫ ⟨ebm_write#(v, vtblpnum3, vtblpnum5, n3, n1, buf; avols; err1)⟩ (abs(avols, apebs, vols, q) ∧ err0 = err1), vols[v][vtblpnum3] = unmapped, n1 = 0, vtblpnum4 = n4, VTBL_VOLID ∈ vols

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubi_io_read_data#(PNUM, OFFSET, N0, N, APEBS; BUF; BITFLIPS, ERR) {if ubi-io-read-data-pre(PNUM, OFFSET, N0, N, BUF, APEBS) then {fail_or_success#(; ; ERR); BITFLIPS := ?; if ERR = ESUCCESS then BUF := copy(APEBS[PNUM].data, OFFSET, BUF, N0, N) else choose BUF0 with # BUF0 = # BUF ∧ range=(BUF0, 0, BUF, 0, N0) ∧ range=(BUF0, N0 + N, BUF, N0 + N, # BUF - N0 + N) in BUF := BUF0} else abort };%⊦ v ∈ avols ∧ m < # avols[v] ∧ abs(avols, apebs, vols, q) → m < # vols[v]; (ss)% ⊦ v ∈ avols ∧ abs(avols, apebs, vols, q) → v ∈ vols; (ss)%abs-vols-unmapped: ⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = unmapped ∧ abs(avols, apebs, vols, q) → ¬ avols[v][m].mapped?; (forward) from specification ubi-abs% ⊦ unmapped ≠ ⌜m⌝ ; (s)