[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 7 from proof prepost-read-superblock (previous step)

avol[0] = mapped(buf1), buf = mkbuf(m2), buf0 = buf, m = 0, m0 = 0, m1 = EB_PAGE_SIZE, m2 = LEB_SIZE, n = m2, n0 = 0, ebm-vol-inv(avol), is-encoded(sb0, buf1) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m0].data + mkempbuf(LEB_SIZE - # avol[m0].data), m, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf0, 0, buf, 0, n0) ∧ range=(buf0, n0 + n, buf, n0 + n, # buf0 - n0 + n) in buf0 := buf; if err = ESUCCESS then let m = ? in decode_superblock#(0, buf0, m1; sb, m; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → sb = sb0)), # avol = 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 8:
avol[0] = mapped(buf1), # avol ≠ 0, ebm-vol-inv(avol), is-encoded(sb0, buf1) ⊦ ⟪fail_or_success#(; ; err); buf := mkbuf(LEB_SIZE); if err = ESUCCESS then buf := copy(avol[0].data + mkempbuf(LEB_SIZE - # avol[0].data), 0, buf, 0, LEB_SIZE) else {n0 := 0; m2 := LEB_SIZE; choose buf1 with # buf1 = # buf ∧ range=(buf, 0, buf1, 0, n0) ∧ range=(buf, n0 + m2, buf1, n0 + m2, # buf - n0 + m2) in buf := buf1}; if err = ESUCCESS then let m = ? in decode_superblock#(0, buf, EB_PAGE_SIZE; sb, m; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → sb = sb0))

Proof step 7 from proof prepost-read-superblock (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information