[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 31 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, apebs0[n2].vidhdr:= (avidhdr(v, m2, sqnum, datasize(buf, n), 0).checksum:= checksum(buf, datasize(buf, n)))], err = ESUCCESS, err = err0, vtblpnum2 = n2, avidhdr(v, m2, sqnum, datasize(buf, n), 0).valid?, aehdr.valid?, n2 < # apebs0, n2 < # wlar, n1 < # wlar, ⌊err0⌋ ∨ err0 = ESUCCESS, v ∈ vols ∧ m2 < # vols[v] ∧ vols[v][m2] = ⌜n1⌝ ∨ v = VTBL_VOLID ∧ m2 = VTBL_LNUM ∧ vtblpnum1 = n1 ⊦ [if err = ESUCCESS then if datasize(buf, n) ≠ 0 then aubi_io_write_data_wl#(vtblpnum2, align↑(datasize(buf, n), EB_PAGE_SIZE), buf; apebs; err); wlar0 := wlar; if err = ESUCCESS then {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, vtblpnum2; wlar, q)] ( sum-of-differences(ecs(wlar).max, ecs(wlar)) = sum-of-differences(ecs(wlar0).max, ecs(wlar0)) ∧ ecs(wlar) = ecs(wlar0) ∧ (err = ESUCCESS → wlar[n2].ec = m0 ∧ wlar[n1].ec = m1)), datasize(buf, n) = 0, n2 = n1

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information