[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 42 from proof inv-rename-new-keep-parent (previous step)

fs0[ri0[dentrykey(m, str)]] = dentrynode(key0, m0), fs0[ri0[inodekey(m)]] = inodenode(key, md0, boolvar0, m4, m5, m6), boolvar0, ri = (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2], 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-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m0) ∈ ri0, dentrykey(m, str) ∈ ri0, 1 ≤ m6, boolvar2 → 1 ≤ m5, ¬ fs0[ri0[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs0[ri0[inodekey(m0)]].nlink ∧ m2 = fs0[ri0[inodekey(m0)]].nsubdirs ∨ fs0[ri0[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs0[ri0[inodekey(m0)]].nlink ∧ m2 = fs0[ri0[inodekey(m0)]].nsubdirs ∧ m3 = fs0[ri0[inodekey(m0)]].size, m4 ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_index_store# (inodekey(m), adr3, fi, ro, fo, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); new_dent := mkdentry(str0, mkdentry(str, m0).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).size)⟫ ( ubifs-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro)), adr1 = adr3, adr1 = adr2, adr2 = adr3, m6 = 0, inodekey(m) ∈ ro, dentrykey(m, str0) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 43:
fs0[ri0[dentrykey(m, str)]] = dentrynode(key0, m0), fs0[ri0[inodekey(m)]] = inodenode(key, md0, true, m4, m5, m6), ri = (ri0 -- dentrykey(m, str))[dentrykey(m, str0), adr2], adr1 ≠ adr3, adr1 ≠ adr2, adr2 ≠ adr3, m6 ≠ 0, 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, inodekey(m) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m0) ∈ ri0, dentrykey(m, str) ∈ ri0, 1 ≤ m6, ¬ inodekey(m) ∈ ro, ¬ dentrykey(m, str0) ∈ ri0, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ ri0 -- dentrykey(m, str), boolvar2 → 1 ≤ m5, ¬ fs0[ri0[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs0[ri0[inodekey(m0)]].nlink ∧ m2 = fs0[ri0[inodekey(m0)]].nsubdirs ∨ fs0[ri0[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs0[ri0[inodekey(m0)]].nlink ∧ m2 = fs0[ri0[inodekey(m0)]].nsubdirs ∧ m3 = fs0[ri0[inodekey(m0)]].size, m4 ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_index_store# (inodekey(m), adr3, fi, ro, fo, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); new_dent := mkdentry(str0, mkdentry(str, m0).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).size)⟫ ( ubifs-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri) ∧ orphans-cons (fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m0)][adr3, inodenode(inodekey(m), md, true, m4, m5, m6)], ri, ro))

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)%not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat