[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 106 from proof write-loop-0 (previous step)

VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, err = err0, m ∈ files, ino2 + ino5 ≤ ino1, ⌊err0⌋ , ino5 = 0 → files = files1 ⊦ [if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino5, mkbuf(VFS_PAGE_SIZE), (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0)); afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), (ino2 + ino5) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1), min(ino1 - ino2 + ino5, n0) = 0

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 107:
VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, err = err0, m ∈ files, ino2 + ino5 ≤ ino1, ⌊err0⌋ , ino5 = 0 → files = files1 ⊦ [skip; if err = ESUCCESS then {buf := copy(buf0, ino5, mkbuf(VFS_PAGE_SIZE), (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0)); afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), (ino2 + ino5) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1), min(ino1 - ino2 + ino5, n0) = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)