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

wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), vtblpnum = 1, vtblpnum0 = n, wlar0 = wlar[n, wlar[n].ec:= (wlar[n].ec + 1)], vtblpnum0 < # wlar1, n < # wlar, n < # apebs0, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ [aubi_io_sync_erase#(vtblpnum0; apebs; err0); wlar1[vtblpnum0].ec := wlar1[vtblpnum0].ec + 1; if err0 = ESUCCESS then aubi_io_write_echdr#(vtblpnum0, aechdr(wlar1[vtblpnum0].ec); apebs; err0) else debug#("ubi: erase of PEB " + vtblpnum0.toString + " failed"); vtblpnum1 := vtblpnum1 + 1] ( n < # wlar ∧ id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])), err0 = ESUCCESS, vtblpnum1 = 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 266:
wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), err0 ≠ ESUCCESS, vtblpnum1 ≠ 0, n < # wlar, n < # apebs0, vtblpnum1 ≤ UBI_ERASE_RETRIES, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err⌋ ⊦ [aubi_io_sync_erase#(n; apebs; err0); wlar1 := wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] [n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1) ]; if err0 = ESUCCESS then aubi_io_write_echdr#(n, aechdr(wlar1[n].ec); apebs; err0) else debug#("ubi: erase of PEB " + n.toString + " failed"); vtblpnum1 := vtblpnum1 + 1] (id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)]))

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ # wlar[n, wle] = # wlar; (s)%⊦ wle = wlar[n] ∧ wle = wlar0[n] → (id○(wlar, wlar0, n) ↔ wlar = wlar0); (s)% ⊦ id○(wlar, wlar0[n, wle], n) ↔ id○(wlar, wlar0, n); (s)