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

0 = min(n5, VFS_PAGE_SIZE - (n0 + n2) % VFS_PAGE_SIZE, n1), err = ESUCCESS, ino1 = n5 + n0 + n2, inode = mkinode(m, md, boolvar, m0, m1, m2), isdir, m2 = n1 + n0 + n2, afs-cons(dirs, files), m ∈ files, n0 + n2 ≤ m2, n5 + n2 ≤ # buf2, n2 ≤ # buf2, ∀ 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 ⊦ ⟪while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, ino1, inode, dirs, files, asynced; buf2, n2, isdir, err)⟫ true

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 96:
0 = min(n5, VFS_PAGE_SIZE - (n0 + n2) % VFS_PAGE_SIZE, n1), err = ESUCCESS, ino1 = n5 + n0 + n2, inode = mkinode(m, md, boolvar, m0, m1, n1 + n0 + n2), isdir, afs-cons(dirs, files), m ∈ files, n2 ≤ # buf2, n5 + n2 ≤ # buf2, ∀ 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 ⊦ ⟪while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, ino1, inode, dirs, files, asynced; buf2, n2, isdir, err)⟫ true

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m ≤ m + n; (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)