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

VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, # links(m, dirs), content), buf0 = buf1, err = ESUCCESS, ino0 = n6, inode = mkinode(m, md, boolvar, m0, m1, m2), n0 + n6 < m2, afs-cons(dirs, files), m ∈ files, (n0 + n6) / VFS_PAGE_SIZE ∈ content, (n0 + n6) % VFS_PAGE_SIZE + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6) ≤ # content[(n0 + n6) / VFS_PAGE_SIZE], ino0 + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6) ≤ # buf0, n5 + n6 ≤ # buf1, n6 ≤ # buf1, n5 + n0 + n6 ≥ n0 + n6, m2 ≥ n0 + n6, ∀ 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 ⊦ ⟪n := ino0 + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6), buf1 := copy(content[(n0 + n6) / VFS_PAGE_SIZE], (n0 + n6) % VFS_PAGE_SIZE, buf0, ino0, min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6)); 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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 41:
VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, # links(m, dirs), content), buf0 = buf, buf1 = copy(content[(n0 + n6) / VFS_PAGE_SIZE], (n0 + n6) % VFS_PAGE_SIZE, buf0, ino0, min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6)), err = ESUCCESS, ino0 = n6, inode = mkinode(m, md, boolvar, m0, m1, m2), n = ino0 + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6), n0 + n6 < m2, afs-cons(dirs, files), m ∈ files, (n0 + n6) / VFS_PAGE_SIZE ∈ content, n6 ≤ # buf, n5 + n6 ≤ # buf, (n0 + n6) % VFS_PAGE_SIZE + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6) ≤ # content[(n0 + n6) / VFS_PAGE_SIZE], ino0 + min(n5 + n0 + n6 - n0 + n6, n7, m2 - n0 + n6) ≤ # buf0, n5 + n0 + n6 ≥ n0 + n6, m2 ≥ n0 + n6, ∀ 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 ⊦ ⟪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

Additional information

Used simplifier rules: ⊦ VFS_PAGE_SIZE ≠ 0; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)% ⊦ m ≤ m + n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ m < n → m ≤ n; (s)% ⊦ m + n - n + n1 = m - n1; (s)% ⊦ m + n - m = n; (s)%⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n0, content) ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE; (s)