[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 70 from proof inv-rename-new-reparent (previous step)

fs0[ri0[inodekey(m0)]] = inodenode(key2, md3, true, m6, m7, m8), fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), fs0[ri0[dentrykey(m, str)]] = dentrynode(key1, m3), fs0[ri0[inodekey(m)]] = inodenode(key3, md2, true, m2, n0 + (boolvar2 ⊃ 1;0), m1 + 1), adr = adr4, fs = fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], key = inodekey(m0), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', ri = (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], mkdentry(str, m3).dentry?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), key-cons(key, fs[adr]), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, ri0[inodekey(m0)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m0) ∈ ri0, inodekey(m3) ∈ ri0, dentrykey(m, str) ∈ ri0, adr ∈ fs, ¬ adr ∈ ri → adr ∈ fs → adr ∈ fs, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10, m6 ≠ 0 ∨ m0 = ROOT_INO, m2 ≠ 0 ∨ m = ROOT_INO ⊦ ⟪old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, n0, m1).meta, inodenode(inodekey(m), md, true, m2, n0, m1).directory, inodenode(inodekey(m), md, true, m2, n0, m1).nlink, inodenode(inodekey(m), md, true, m2, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m2, n0, m1).size); new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).size)⟫ ( ubifs-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ file-node-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr]) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro)), adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m = 0, m0 = m, adr ∈ ri, adr2 ∈ ri0 -- dentrykey(m, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m0) ∈ ro, dentrykey(m0, str0) ∈ ri0, inodekey(m) ∈ ro, adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2]

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 71:
fs0[ri0[inodekey(m)]] = inodenode(key3, md2, true, m2, n0 + (boolvar2 ⊃ 1;0), m1 + 1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key1, m3), fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), fs0[ri0[inodekey(m0)]] = inodenode(key2, md3, true, m6, m7, m8), adr = adr4, fs = fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], key = inodekey(m0), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', ri = (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], mkdentry(str, m3).dentry?, inodenode(inodekey(m), md, true, m2, n0, m1).inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), key-cons(key, fs[adr]), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), adr ∈ fs, dentrykey(m, str) ∈ ri0, inodekey(m3) ∈ ri0, inodekey(m0) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, ¬ adr ∈ ri → adr ∈ fs → adr ∈ fs, inodenode(inodekey(m), md, true, m2, n0, m1).trunc? ∨ inodenode(inodekey(m), md, true, m2, n0, m1).inode?, m2 ≠ 0 ∨ m = ROOT_INO, m6 ≠ 0 ∨ m0 = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10 ⊦ ⟪new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).size)⟫ ( ubifs-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ file-node-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr]) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m3)][adr3, inodenode(inodekey(m), md, true, m2, n0, m1)] [adr4, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ], ri[key, adr], ro)), adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m = 0, m0 = m, adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2], inodekey(m) ∈ ro, dentrykey(m0, str0) ∈ ri0, inodekey(m0) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str), adr ∈ ri

Rule argument

Additional information

Used simplifier rules: at-fs: ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]);% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)%⊦ key-cons(inodekey(ino), nd) ↔ nd.inode? ∧ nd.key = inodekey(ino) ∧ ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)