[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 1230 from proof refine-truncate (previous step)

boolvar ↔ boolvar4, 0 = fs0[ri0[inodekey(m)]].nsubdirs, adr = adr2, dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), fs = fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], inode = mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, 0, m2), key = inodekey(m), log = (log0 + adr1 ') + adr2 ', m0 = fs0[ri0[inodekey(m)]].nlink, ri = ri0[key, adr], ro = orphans(fs0, ri0), ro0 = orphans(fs0, ri0), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced → boolvar0 ⊦ [aubifs_core_index_truncate#(inodekey(m), min(n, m2), fi, ro0, fo, fs, (log0 + adr1 ') + adr2 ', boolvar4; ri); boolvar1 := false; inode := mkinode (inode.ino, inodenode(inodekey(m), md, false, m0, 0, n).meta, inodenode(inodekey(m), md, false, m0, 0, n).directory, inodenode(inodekey(m), md, false, m0, 0, n).nlink, inodenode(inodekey(m), md, false, m0, 0, n).nsubdirs, inodenode(inodekey(m), md, false, m0, 0, n).size); buf-opt := buf-opt0; if boolvar1 then buf-opt := some(inodenode(inodekey(m), md, false, m0, 0, n).data)] ( ubifs-cons(fs, ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong(fs, ri, ro0, fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log0, fs) ∧ adr1 ∈ fs ∧ node-cons(fs[adr1].key, fs[adr1]) ∧ adr2 ∈ fs ∧ node-cons(fs[adr2].key, fs[adr2]) → ⟨p_inode := mkinode(m, md, false, m0, 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err0, dirs, files, asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err0)), adr1 = adr2, fs0[ri0[inodekey(m)]].directory, adr2 ∈ fs0, adr1 ∈ fs0, m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 1231:
0 = fs0[ri0[inodekey(m)]].nsubdirs, ri = ri0[inodekey(m), adr2], adr1 ≠ adr2, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, ¬ fs0[ri0[inodekey(m)]].directory, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, asynced → boolvar0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE ⊦ [aubifs_core_index_truncate# (inodekey(m), min(n, m2), fi, orphans(fs0, ri0), fo, fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], (log0 + adr1 ') + adr2 ', boolvar4 ; ri); boolvar1 := false; inode := mkinode (mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, 0, m2).ino, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n).meta, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n).directory, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n).nlink, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n).nsubdirs, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n).size); buf-opt := buf-opt0; m0 := fs0[ri0[inodekey(m)]].nlink; if boolvar1 then buf-opt := some(inodenode(inodekey(m), md, false, m0, 0, n).data)] ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri, orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri, orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri, orphans(fs0, ri0)) ∧ ri-inj(ri) ∧ m ≠ 0 → ⟨p_inode := mkinode(m, md, false, m0, 0, m2); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, p_inode, boolvar2, err0, dirs, files, asynced)⟩ ( dirs = abs-dirs (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri) ∧ files = abs-files (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri) ∧ orphans (abs-dirs (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri), abs-files (fs0[adr1, truncnode(inodekey(m), min(n, m2))][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, 0, n)], ri)) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ buf-opt = buf-opt0 ∧ inode = p_inode ∧ (boolvar1 ↔ boolvar2) ∧ ESUCCESS = err0)), m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

Additional information

Used simplifier rules: log-cons-2: ⊦ log-cons(log, fs) ∧ ¬ adr0 ∈ fs ∧ ¬ adr1 ∈ fs ∧ adr0 ≠ adr1 → log-cons(log, fs[adr0, nd0][adr1, nd1]);% ⊦ inodekey(m).ino = m; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ node-cons(key0, truncnode(key1, n)) ↔ key0.inode?; (s)% ⊦ truncnode(key, m).key = key; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ adr ∈ fs[adr0, nd] ↔ adr = adr0 ∨ adr ∈ fs; (ws)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)