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

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), fo.inodes?, ro.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-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), 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, m2 ≠ 0 ∨ m = ROOT_INO, m6 ≠ 0 ∨ m0 = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10, adr = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr = adr4 ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m = 0, m0 = m, m0 = 0, adr ∈ log0, 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), adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], (adr = adr4 ∨ adr = adr3 ∨ adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .inode? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode? ∧ (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .ino ≠ 0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .dentry? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .dentry?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .data? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .data?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .trunc? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode?)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 127:
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), 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-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 = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr = adr4, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10, m6 ≠ 0 ∨ m0 = ROOT_INO, m2 ≠ 0 ∨ m = ROOT_INO ⊦ adr = adr1, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m = 0, m0 = 0, m0 = m, adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], 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], adr ∈ log0, (adr = adr4 ∨ adr = adr3 ∨ adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .inode? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode? ∧ (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .ino ≠ 0) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .dentry? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .dentry?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .data? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .data?) ∧ ( (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .trunc? → (adr4 = adr ⊃ inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1) ;(adr3 = adr ⊃ inodenode(inodekey(m), md, true, m2, n0, m1) ;(adr2 = adr ⊃ dentrynode(dentrykey(m0, str0), m3);(adr1 = adr ⊃ dentrynode(dentrykey(m, str), 0);fs0[adr])) ) ) .key .inode?)

Rule argument

fma: adr = adr1

Additional information

Used simplifier rules: ⊦ ¬ dentrynode(key, m).inode?; (s)% ⊦ dentrynode(key, m).dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ ¬ dentrynode(key, m).data?; (s)% ⊦ ¬ dentrynode(key, m).trunc?; (s) Used formulas: adr = adr1