[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 280 from proof wlar-erase-worker-helper (previous step)

apebs1[n] = mkpeb(aehdr0, avhdr0, buf0, m, false), apebs0[n] = mkpeb(aehdr1, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), aehdr = aechdr(wlar[n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1)][n].ec), apebs = apebs1[n, mkpeb(empty, empty, mkempbuf(LEB_SIZE), 0, false)], vtblpnum = n, n < # wlar[n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1)], n < # wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)], n < # wlar, n < # apebs1, n < # apebs0, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, vtblpnum1 ≤ UBI_ERASE_RETRIES, ⌊err2⌋ ⊦ [if ubi-io-write-echdr-pre(vtblpnum, aehdr, apebs) then {fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum].echdr := aehdr else choose aehdr with ¬ aehdr.valid? in apebs[vtblpnum].echdr := aehdr} else abort; vtblpnum := vtblpnum1 + 1] ( vtblpnum ≠ 0 ∧ vtblpnum ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat1. wlar[n, wl-entry((wlar[n].ec + vtblpnum1) + 1, stat)] = wlar[n, wl-entry(wlar[n].ec + vtblpnum, stat1)])), err1 = ESUCCESS, vtblpnum1 = 0

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 281:
wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr1, avhdr, buf, m1, false), apebs1[n] = mkpeb(aehdr0, avhdr0, buf0, m, false), aehdr = aechdr(wlar[n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1)][n].ec), apebs = apebs1[n, mkpeb(empty, empty, mkempbuf(LEB_SIZE), 0, false)], vtblpnum = n, n < # apebs0, n < # apebs1, n < # wlar, n < # wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)], n < # wlar[n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1)], vtblpnum1 ≤ UBI_ERASE_RETRIES, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err2⌋ ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum].echdr := aehdr else choose aehdr with ¬ aehdr.valid? in apebs[vtblpnum].echdr := aehdr; vtblpnum := vtblpnum1 + 1] ( vtblpnum ≠ 0 ∧ vtblpnum ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat1. wlar[n, wl-entry((wlar[n].ec + vtblpnum1) + 1, stat)] = wlar[n, wl-entry(wlar[n].ec + vtblpnum, stat1)])), err1 = ESUCCESS, vtblpnum1 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ wl-entry(m, stat).ec = m; (s)% ⊦ m < # wlar → wlar[m, wle][m] = wle; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ wl-entry(m, stat).ec:= m0 = wl-entry(m0, stat); (s)%⊦ ubi-io-write-echdr-pre(n, aehdr, apebs) ↔ n < # apebs ∧ ¬ apebs[n].bad ∧ aehdr.valid? ∧ apebs[n].echdr = empty; (s)% ⊦ # apebs[n, apeb] = # apebs; (s)% ⊦ m < # apebs → apebs[m, apeb][m] = apeb; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).bad ↔ boolvar; (s)% ⊦ aechdr(m).valid?; (s)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).echdr = aehdr; (s)