| boolvar1 ↔ boolvar2, 0 = m1, fs[ri[inodekey(m)]] = inodenode(key, md0, boolvar, m0, m1, m3), ¬ boolvar, buf-opt = buf-opt0, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), p_inode = mkinode(m, md, false, m0, 0, m2), fs[ri[inodekey(m)]].inode?, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, ⌊err0⌋ , buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced → boolvar0 ⊦ ⟨afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ mkinode(m, md, false, m0, 0, m2) = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ err0 = err1), m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0 |
boolvar1 ↔ boolvar2, fs[ri[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), buf-opt = buf-opt0, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), p_inode = mkinode(m, md, false, m0, 0, m2), fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, ⌊err0⌋ , buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced → boolvar0 ⊦ ⟨afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err1, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ mkinode(m, md, false, m0, 0, m2) = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ err0 = err1), m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0
Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)