[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 34 from proof delta-atomic-leb-change (previous step)

apebs0[n2] = mkpeb(aehdr, empty, buf0, m, false), wlar[n2] = wl-entry(m0, stat), wlar[n1] = wl-entry(m1, stat0), apebs = apebs0[n2, mkpeb(aehdr, avidhdr(v, m2, sqnum, datasize(buf, n), checksum(buf, datasize(buf, n))), buf0, m, false)], datasize(buf, n) ≠ 0, n2 ≠ n1, aehdr.valid?, n2 < # apebs0, n2 < # wlar, n1 < # wlar, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum1 = n1 ⊦ [aubi_io_write_data_wl#(n2, align↑(datasize(buf, n), EB_PAGE_SIZE), buf; apebs; err0); wlar0 := wlar; if err0 = ESUCCESS then {vtblpnum2 := n2; if v = VTBL_VOLID ∧ m2 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum1; wlar, q); bflipset := bflipset -- vtblpnum1; vtblpnum1 := vtblpnum2} else {if vols[v][m2] ≠ unmapped then let vtblpnum0 = vols[v][m2].pnum in {ubi_wl_put_peb#(v × m2, vtblpnum0; wlar, q); bflipset := bflipset -- vtblpnum0}; vols[v][m2] := ⌜vtblpnum2⌝ }; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used)} else ubi_wl_put_peb#(none, n2; wlar, q)] ( sum-of-differences(ecs(wlar).max, ecs(wlar)) = sum-of-differences(ecs(wlar0).max, ecs(wlar0)) ∧ ecs(wlar) = ecs(wlar0) ∧ (err0 = ESUCCESS → wlar[n2].ec = m0 ∧ wlar[n1].ec = m1))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 35:
wlar[n1] = wl-entry(m1, stat0), wlar[n2] = wl-entry(m0, stat), apebs0[n2] = mkpeb(aehdr, empty, buf1, m, false), apebs = apebs0[n2, mkpeb(aehdr, avidhdr(v, m2, sqnum, datasize(buf, n0), checksum(buf, datasize(buf, n0))), buf1, m, false)], buf0 = buf, n = align↑(datasize(buf, n0), EB_PAGE_SIZE), vtblpnum = n2, aehdr.valid?, n1 < # wlar, n2 < # wlar, n2 < # apebs0, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum1 = n1 ⊦ [if ubi-io-write-data-wl-pre(vtblpnum, n, buf0, apebs) then {fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum] := mkpeb(apebs[vtblpnum].echdr, apebs[vtblpnum].vidhdr, subarray(buf0, 0, n) + mkempbuf(LEB_SIZE - n), n, apebs[vtblpnum].bad) else choose buf with # buf ≤ n ∧ is-aligned(# buf, EB_PAGE_SIZE) ∧ ( datasize(buf, # buf) < datasize(buf0, n) ∨ checksum(buf + mkempbuf(n - # buf), datasize(buf0, n)) ≠ checksum(buf0, datasize(buf0, n))) in apebs[vtblpnum] := mkpeb(apebs[vtblpnum].echdr, apebs[vtblpnum].vidhdr, buf + mkempbuf(LEB_SIZE - # buf), # buf, apebs[vtblpnum].bad)} else abort; wlar0 := wlar; err0 := err; if err0 = ESUCCESS then {vtblpnum2 := n2; if v = VTBL_VOLID ∧ m2 = VTBL_LNUM then {ubi_wl_put_peb#(VTBL_VOLID × VTBL_LNUM, vtblpnum1; wlar, q); bflipset := bflipset -- vtblpnum1; vtblpnum1 := vtblpnum2} else {if vols[v][m2] ≠ unmapped then let vtblpnum0 = vols[v][m2].pnum in {ubi_wl_put_peb#(v × m2, vtblpnum0; wlar, q); bflipset := bflipset -- vtblpnum0}; vols[v][m2] := ⌜vtblpnum2⌝ }; wlar[vtblpnum2] := wl-entry(wlar[vtblpnum2].ec, used)} else ubi_wl_put_peb#(none, n2; wlar, q)] ( sum-of-differences(ecs(wlar).max, ecs(wlar)) = sum-of-differences(ecs(wlar0).max, ecs(wlar0)) ∧ ecs(wlar) = ecs(wlar0) ∧ (err0 = ESUCCESS → wlar[n2].ec = m0 ∧ wlar[n1].ec = m1)), datasize(buf, n0) = 0, n2 = n1

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubi_io_write_data_wl#(PNUM, N, BUF; APEBS; ERR) {if ubi-io-write-data-wl-pre(PNUM, N, BUF, APEBS) then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then APEBS[PNUM] := mkpeb (APEBS[PNUM].echdr, APEBS[PNUM].vidhdr, subarray(BUF, 0, N) + mkempbuf(LEB_SIZE - N), N, APEBS[PNUM].bad) else choose BUF0 with # BUF0 ≤ N ∧ is-aligned(# BUF0, EB_PAGE_SIZE) ∧ ( datasize(BUF0, # BUF0) < datasize(BUF, N) ∨ checksum (BUF0 + mkempbuf(N - # BUF0), datasize(BUF, N)) ≠ checksum(BUF, datasize(BUF, N))) in APEBS[PNUM] := mkpeb (APEBS[PNUM].echdr, APEBS[PNUM].vidhdr, BUF0 + mkempbuf(LEB_SIZE - # BUF0), # BUF0, APEBS[PNUM].bad)} else abort };