[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 35 from proof inv-recover (previous step)

# wlar1 = # wlar, # apebs0 = # wlar, apebs0[m] = mkpeb(aehdr, avhdr, buf0, m0, boolvar), recs0[VTBL_VOLID × VTBL_LNUM] = recovery-entry(m, avhdr.sqn), buf = mkbuf(LEB_SIZE), nx < # wlar, bflipset-cons(bflipset, wlar), bflipset-cons(bflipset1, wlar1), indices-erasing(wlar, nx), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar1, vols1, vtblpnum1), valid-eraseq(wlar, q), valid-eraseq(apebs0, q1), valid-eraseq(wlar1, q1), valid-eraseq(q1), valid-eraseq-stronger(apebs0, q), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs0, vtblpnum5), valid-recs(apebs0, wlar, recs0), valid-recs-sqns(apebs0, recs0), valid-vtbl(apebs0, vols1, wlar1, vtblpnum1), valid-wl(apebs0, wlar), valid-wl(apebs0, wlar1), VTBL_VOLID × VTBL_LNUM ∈ recs0, ¬ dups(nx), ¬ VTBL_VOLID ∈ vols1, ¬ vtblpnum1 ∈ q1, ¬ m ∈ q ⊦ ⟪aubi_io_read_data#(m, 0, 0, LEB_SIZE, apebs0; buf; bitflips, err); vtblpnum3 := m; if bitflips then bflipset := bflipset ++ vtblpnum3; vols := ∅; if err = ESUCCESS then let vtbl = ? in {decode_vtbl#(buf; ; vtbl, err); if err = ESUCCESS then {ubi_init_vols_sizes#(recs0, wlar, apebs0; vtbl, vols); ubi_init_vols_mappings#(vtblpnum3, apebs0; recs0, vols, wlar, q, bflipset); let n = (vtblpnum0 = 0 ⊃ 0;vtblpnum / vtblpnum0) in ubi_fix_ecs#(n; nx, wlar)}}⟫ ( ( err = ESUCCESS → # wlar1 = # wlar ∧ valid-wl(apebs0, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs0, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs0, wlar, vols, vtblpnum3) ∧ valid-vtbl(apebs0, vols, wlar, vtblpnum3)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-max(apebs0, vols, wlar, q, bflipset, vtblpnum3, sqnum) ∧ q.lebrefs ⊆ q1.lebrefs ∧ vols1 ⊆ vols ∧ vols⌈vols1, q1⌉))

User applied rule cut formula

And obtained the following new goals

Proof step 36:
# apebs0 = # wlar, # wlar1 = # wlar, recs0[VTBL_VOLID × VTBL_LNUM] = recovery-entry(m, avhdr.sqn), apebs0[m] = mkpeb(aehdr, avhdr, buf0, m0, boolvar), buf = mkbuf(LEB_SIZE), m = vtblpnum1, nx < # wlar, bflipset-cons(bflipset1, wlar1), bflipset-cons(bflipset, wlar), indices-erasing(wlar, nx), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar1, vols1, vtblpnum1), valid-eraseq(q1), valid-eraseq(wlar1, q1), valid-eraseq(apebs0, q1), valid-eraseq(wlar, q), valid-eraseq-stronger(apebs0, q), valid-global-sqn(apebs0, vtblpnum5), valid-global-sqn(apebs0, sqnum), valid-recs(apebs0, wlar, recs0), valid-recs-sqns(apebs0, recs0), valid-vtbl(apebs0, vols1, wlar1, vtblpnum1), valid-wl(apebs0, wlar1), valid-wl(apebs0, wlar), VTBL_VOLID × VTBL_LNUM ∈ recs0 ⊦ ⟪aubi_io_read_data#(m, 0, 0, LEB_SIZE, apebs0; buf; bitflips, err); vtblpnum3 := m; if bitflips then bflipset := bflipset ++ vtblpnum3; vols := ∅; if err = ESUCCESS then let vtbl = ? in {decode_vtbl#(buf; ; vtbl, err); if err = ESUCCESS then {ubi_init_vols_sizes#(recs0, wlar, apebs0; vtbl, vols); ubi_init_vols_mappings#(vtblpnum3, apebs0; recs0, vols, wlar, q, bflipset); let n = (vtblpnum0 = 0 ⊃ 0;vtblpnum / vtblpnum0) in ubi_fix_ecs#(n; nx, wlar)}}⟫ ( ( err = ESUCCESS → # wlar1 = # wlar ∧ valid-wl(apebs0, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs0, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs0, wlar, vols, vtblpnum3) ∧ valid-vtbl(apebs0, vols, wlar, vtblpnum3)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-max(apebs0, vols, wlar, q, bflipset, vtblpnum3, sqnum) ∧ q.lebrefs ⊆ q1.lebrefs ∧ vols1 ⊆ vols ∧ vols⌈vols1, q1⌉)), dups(nx), VTBL_VOLID ∈ vols1, vtblpnum1 ∈ q1, m ∈ q
Proof step 251:
# apebs0 = # wlar, # wlar1 = # wlar, recs0[VTBL_VOLID × VTBL_LNUM] = recovery-entry(m, avhdr.sqn), apebs0[m] = mkpeb(aehdr, avhdr, buf0, m0, boolvar), buf = mkbuf(LEB_SIZE), nx < # wlar, bflipset-cons(bflipset1, wlar1), bflipset-cons(bflipset, wlar), indices-erasing(wlar, nx), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar1, vols1, vtblpnum1), valid-eraseq(q1), valid-eraseq(wlar1, q1), valid-eraseq(apebs0, q1), valid-eraseq(wlar, q), valid-eraseq-stronger(apebs0, q), valid-global-sqn(apebs0, vtblpnum5), valid-global-sqn(apebs0, sqnum), valid-recs(apebs0, wlar, recs0), valid-recs-sqns(apebs0, recs0), valid-vtbl(apebs0, vols1, wlar1, vtblpnum1), valid-wl(apebs0, wlar1), valid-wl(apebs0, wlar), VTBL_VOLID × VTBL_LNUM ∈ recs0 ⊦ ⟪aubi_io_read_data#(m, 0, 0, LEB_SIZE, apebs0; buf; bitflips, err); vtblpnum3 := m; if bitflips then bflipset := bflipset ++ vtblpnum3; vols := ∅; if err = ESUCCESS then let vtbl = ? in {decode_vtbl#(buf; ; vtbl, err); if err = ESUCCESS then {ubi_init_vols_sizes#(recs0, wlar, apebs0; vtbl, vols); ubi_init_vols_mappings#(vtblpnum3, apebs0; recs0, vols, wlar, q, bflipset); let n = (vtblpnum0 = 0 ⊃ 0;vtblpnum / vtblpnum0) in ubi_fix_ecs#(n; nx, wlar)}}⟫ ( ( err = ESUCCESS → # wlar1 = # wlar ∧ valid-wl(apebs0, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs0, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs0, wlar, vols, vtblpnum3) ∧ valid-vtbl(apebs0, vols, wlar, vtblpnum3)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-max(apebs0, vols, wlar, q, bflipset, vtblpnum3, sqnum) ∧ q.lebrefs ⊆ q1.lebrefs ∧ vols1 ⊆ vols ∧ vols⌈vols1, q1⌉)), m = vtblpnum1, dups(nx), VTBL_VOLID ∈ vols1, vtblpnum1 ∈ q1, m ∈ q

Rule argument

fma: m = vtblpnum1

Additional information

Used formulas: m = vtblpnum1