Proof step 151 from proof refine-truncate (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 152:

  # buf-opt0.buf = VFS_PAGE_SIZE, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri0[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), orphans(fs0, ri0).inodes?, fo.inodes?, buf-opt0.some?, afs-cons (abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n1, md, m0, abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)] upto m2)]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m0, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m0, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m0, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m0, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj ( ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m0, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, m2 ≤ n1, asynced0 → boolvar0 ⊦ m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)] ↔ datakey(m, n) ∈ ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] ∧ (¬ datakey(m, n) ∈ ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3] ∨ ¬ m2 ≤ n * VFS_PAGE_SIZE)) ∧ ( n * VFS_PAGE_SIZE < m2 ∧ n ∈ abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)] → abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)][n] = (adr3 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf-opt0.buf, zero, m2 % VFS_PAGE_SIZE, n0)) ;(adr2 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n1) ;(adr1 = (datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)]) ⊃ truncnode(inodekey(m), m2) ;fs0[(datakey(m, m2 / VFS_PAGE_SIZE) = datakey(m, n) ⊃ adr3;ri0[datakey(m, n)])] ) ) ) .data)

Rule argument

Additional information

Used simplifier rules: at-ri: ⊦ ri[key, adr][key0] = (key = key0 ⊃ adr;ri[key0]);% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ inodekey(m) ≠ datakey(m0, m1); (s)% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ (ri \ ks)[key] = (key ∈ ks ⊃ (∅)[key];ri[key]); (s)%⊦ m * VFS_PAGE_SIZE < n ∧ m ∈ content → (content upto n)[m] = content[m]; (s)%mult-c: ⊦ m * n = n * m; from specification nat-mult%mult-a: ⊦ m0 * m * n = (m0 * m) * n; from specification nat-mult% ⊦ datakey(m, m0).part = m0; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ datakey(m, m0).ino = m; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ datakey(m, m0).data?; (s)%⊦ key ∈ datakeys(key0, ri) ↔ key ∈ ri ∧ key.data? ∧ key0.inode? ∧ key.ino = key0.ino; (s)% ⊦ datakeys(key, ri[inodekey(ino), adr]) = datakeys(key, ri); (s)%⊦ key ∈ datakeys(key0, n, ri) ↔ key ∈ datakeys(key0, ri) ∧ n ≤ key.part * VFS_PAGE_SIZE; (s)% ⊦ key ∈ ri \ ks ↔ key ∈ ri ∧ ¬ key ∈ ks; (ls)% ⊦ m ∈ content upto n ↔ m * VFS_PAGE_SIZE < n ∧ m ∈ content; (s)%⊦ content = abs-content(ino, fs, ri) ↔ (∀ n. (n ∈ content ↔ datakey(ino, n) ∈ ri) ∧ (n ∈ content → content[n] = fs[ri[datakey(ino, n)]].data)); (ss)%⊦ mkfile(m0, md0, n0, content0) = mkfile(m1, md1, n1, content1) ↔ ¬(n0 ≠ n1 ∨ md0 ≠ md1 ∨ m0 ≠ m1 ∨ content0 ≠ content1); (ss)% ⊦ key ∈ ri[key, adr]; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).meta = md; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)