[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 24 from proof read-loop-term (previous step)

VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, m2 ≠ n0 + n6, n5 ≠ 0, n7 ≠ 0, n0 + n6 < m2, afs-cons(dirs, files), m ∈ files, n6 ≤ # buf1, n5 + n6 ≤ # buf1, ∀ n2, n3, n4, err, inode, m, md, boolvar, m0, m1, m2, isdir, dirs, files, buf, asynced. n2 - n3 + n4 < n5 → err = ESUCCESS ∧ inode = mkinode(m, md, boolvar, m0, m1, m2) ∧ ¬ isdir ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ n4 ≤ # buf ∧ n3 + n4 ≤ m2 ∧ n3 + n4 ≤ n2 ∧ n2 ≤ # buf + n3 → ⟪vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err); while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err)⟫ true ⊦ ⟪afs_readpage#(mkinode(m, md, boolvar, m0, m1, m2), (n0 + n6) / VFS_PAGE_SIZE, dirs, files, asynced; buf, err); n := min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6); ino0 := n6; buf0 := buf1; if err = ESUCCESS then {buf0 := copy(buf, (n0 + n6) % VFS_PAGE_SIZE, buf0, ino0, n); ino0 := ino0 + n}; inode := mkinode(m, md, boolvar, m0, m1, m2); n := ino0, buf1 := buf0; n1 := n5 + n0 + n6; isdir := false; while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, n1, inode, dirs, files, asynced; buf1, n, isdir, err)⟫ true

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 25:
VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, inode = mkinode(m, md, boolvar, m0, m1, m2), pageno = (n0 + n6) / VFS_PAGE_SIZE, n0 + n6 < m2, afs-cons(dirs, files), m ∈ files, n5 + n6 ≤ # buf1, n6 ≤ # buf1, ∀ n2, n3, n4, err, inode, m, md, boolvar, m0, m1, m2, isdir, dirs, files, buf, asynced. n2 - n3 + n4 < n5 → err = ESUCCESS ∧ inode = mkinode(m, md, boolvar, m0, m1, m2) ∧ ¬ isdir ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ n4 ≤ # buf ∧ n3 + n4 ≤ m2 ∧ n3 + n4 ≤ n2 ∧ n2 ≤ # buf + n3 → ⟪vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err); while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err)⟫ true ⊦ ⟪if pre-readpage(inode, pageno, buf, dirs, files) then { {if pageno ∈ files[inode.ino].content then buf := files[inode.ino].content[pageno] else buf := zeropage; err := ESUCCESS} or fail#(; ; err)} else abort; n := min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6); ino0 := n6; buf0 := buf1; if err = ESUCCESS then {buf0 := copy(buf, (n0 + n6) % VFS_PAGE_SIZE, buf0, ino0, n); ino0 := ino0 + n}; inode := mkinode(m, md, boolvar, m0, m1, m2); n := ino0, buf1 := buf0; n1 := n5 + n0 + n6; isdir := false; while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, n1, inode, dirs, files, asynced; buf1, n, isdir, err)⟫ true, VFS_PAGE_SIZE = 0, m2 = n0 + n6, n5 = 0, n7 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_readpage#(INODE, PAGENO, DIRS, FILES, ASYNCED; PBUF, ERR) {if pre-readpage(INODE, PAGENO, PBUF, DIRS, FILES) then { {if PAGENO ∈ FILES[INODE.ino].content then PBUF := FILES[INODE.ino].content[PAGENO] else PBUF := zeropage; ERR := ESUCCESS} or fail#(; ; ERR)} else abort };% ⊦ VFS_PAGE_SIZE ≠ 0; (s)