| # apebs = # wlar, bflipset0 = bflipset, bflipset-cons(bflipset, wlar), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum), valid-wl(apebs, wlar), ¬ VTBL_VOLID ∈ vols, ¬ vtblpnum ∈ q ⊦ ⟪ubi_get_pebs_for_wl#(wlar; n, m, bflipset; boolvar)⟫ ( bflipset-cons(bflipset, wlar) ∧ ( boolvar → n < # wlar ∧ wlar[n].status = free ∧ m < # wlar ∧ wlar[m].status = used ∧ (bflipset0 = ∅ → wlar[m].ec + WL_THRESHOLD ≤ wlar[n].ec))) |
# apebs = # wlar, bflipset0 = bflipset, vtblpnum = m, vtblpnum0 = n, bflipset-cons(bflipset, wlar), unique-sqns(apebs), valid-ebatbl(apebs, wlar, vols, vtblpnum1), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs, sqnum), valid-vtbl(apebs, vols, wlar, vtblpnum1), valid-wl(apebs, wlar) ⊦ ⟪boolvar0 := false; let boolvar = ?, n = ? in {ubi_wl_get_free_min#(wlar; n; boolvar); if boolvar then {ubi_wl_find_free_max_below#(n + 2 * WL_THRESHOLD, wlar; vtblpnum0); if bflipset ≠ ∅ then choose n with n ∈ bflipset in {vtblpnum := n; bflipset := bflipset -- n; boolvar0 := true} else {ubi_wl_get_used_min#(wlar; vtblpnum; boolvar); if boolvar ∧ wlar[vtblpnum0].ec ≥ wlar[vtblpnum].ec + WL_THRESHOLD then boolvar0 := true}}}⟫ ( bflipset-cons(bflipset, wlar) ∧ ( boolvar0 → vtblpnum0 < # wlar ∧ wlar[vtblpnum0].status = free ∧ vtblpnum < # wlar ∧ wlar[vtblpnum].status = used ∧ (bflipset0 = ∅ → wlar[vtblpnum].ec + WL_THRESHOLD ≤ wlar[vtblpnum0].ec))), VTBL_VOLID ∈ vols, vtblpnum1 ∈ q
Used simplifier rules: get-pebs-for-wl: ⊦ ;