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

fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) = datanode(key, buf), fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, key = datakey(m, m2 / VFS_PAGE_SIZE), ri = ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3], (fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)).data?, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs0[ri0[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), node-cons (datakey(m, m2 / VFS_PAGE_SIZE), fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, m2 ≤ n ⊦ ⟪aubifs_core_index_store# (inodekey(m), adr2, fi, ro, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n)] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar0 ; ri); aubifs_core_index_truncate# (inodekey(m), m2, fi, ro, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n)] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar0 ; ri); boolvar1 := true; inode := mkinode (mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, m2).ino, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).meta, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).directory, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nlink, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nsubdirs, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).size); if boolvar1 then buf-opt := some(buf)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro)), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, fs0[ri0[inodekey(m)]].directory, buf-opt.some?, adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 298:
fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf), fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, ri = ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3], m2 % VFS_PAGE_SIZE ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, m ≠ 0, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs0[ri0[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, m2 ≤ n, ¬ fs0[ri0[inodekey(m)]].directory, ¬ buf-opt.some?, ¬ adr3 ∈ ri0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0 ⊦ ⟪aubifs_core_index_store# (inodekey(m), adr2, fi, ro, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n)] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar0 ; ri); aubifs_core_index_truncate# (inodekey(m), m2, fi, ro, fo, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n)] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar0 ; ri); boolvar1 := true; inode := mkinode (mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, m2).ino, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).meta, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).directory, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nlink, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).nsubdirs, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n).size); if boolvar1 then buf-opt := some(buf)⟫ ( ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri) ∧ orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)] [adr2, inodenode(inodekey(m), md, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n) ] [adr3, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], ri, ro))

Rule argument

Additional information

Used simplifier rules: ⊦ datakey(m, m0).data?; (s)% ⊦ node-cons(key0, datanode(key1, buf)) ↔ key0.data?; (s)% ⊦ datanode(key, buf).data?; (s)