[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 21 from proof write-block-inv (previous step)

VFS_PAGE_SIZE = n3 + (n0 + n2) % VFS_PAGE_SIZE, err = err0, err1 = ESUCCESS, files = files1, write-inv(n0, n1, inode, buf1, n2, dirs, files0, files1), n0 + n2 ≤ n1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [choose bv with true in asynced := bv; if err = ESUCCESS then {buf0 := copy(buf1, n2, getpage((n0 + n2) / VFS_PAGE_SIZE, files1[inode.ino].content), (n0 + n2) % VFS_PAGE_SIZE, min(n1 - n0 + n2, n3)); afs_writepage#(inode, (n0 + n2) / VFS_PAGE_SIZE, buf0, dirs; err, files1; asynced0)}; n := min(n1 - n0 + n2, n3); if err = ESUCCESS then n2 := n2 + n] write-inv(n0, n1, inode, buf1, n2, dirs, files0, files1), min(n1 - n0 + n2, n3) = 0

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 22:
VFS_PAGE_SIZE = n3 + (n0 + n2) % VFS_PAGE_SIZE, err = err0, err1 = ESUCCESS, files = files1, write-inv(n0, n1, inode, buf1, n2, dirs, files0, files1), n0 + n2 ≤ n1, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [asynced := bv; if err = ESUCCESS then {buf0 := copy(buf1, n2, getpage((n0 + n2) / VFS_PAGE_SIZE, files1[inode.ino].content), (n0 + n2) % VFS_PAGE_SIZE, min(n1 - n0 + n2, n3)); afs_writepage#(inode, (n0 + n2) / VFS_PAGE_SIZE, buf0, dirs; err, files1; asynced0)}; n := min(n1 - n0 + n2, n3); if err = ESUCCESS then n2 := n2 + n] write-inv(n0, n1, inode, buf1, n2, dirs, files0, files1), min(n1 - n0 + n2, n3) = 0

Proof step 21 from proof write-block-inv (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information