Proof step 1146 from proof refine-rename-overwrite-keep-parent-different (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 1147:

  m11 + 1 = fs[ri[inodekey(m7)]].size, n0 + (boolvar1 ⊃ 1;0) = fs[ri[inodekey(m7)]].nsubdirs, ¬ fs[ri[inodekey(m3)]].directory ↔ ¬ fs[ri[inodekey(m)]].directory, fs[ri[dentrykey(m7, str)]] = dentrynode(key, m), fs[ri[dentrykey(m7, str0)]] = dentrynode(key0, m3), dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode = mkinode(m3, md0, boolvar2, m10 + 1, m5, m6), new_inode = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m3), old_dent_inode = mkinode(m, md, boolvar1, m0, m1, m2), old_inode = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1), fs[ri[dentrykey(m7, str0)]].dentry?, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(m7)]].inode?, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m7, str) ∈ ri, ri[dentrykey(m7, str)] ∈ fs, inodekey(m7) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m) ∈ ri, inodekey(m3) ∈ ri, ri[dentrykey(m7, str0)] ∈ fs, dentrykey(m7, str0) ∈ ri, ⌊err0⌋ , m10 = 0 → links(m3, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar3 → boolvar4, fs[ri[inodekey(m3)]].directory → abs-children(m3, fs, ri) = ∅, fs[ri[inodekey(m3)]].directory → dentrykeys(inodekey(m3), ri) = ∅, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∨ fs[ri[inodekey(m3)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ m6 = fs[ri[inodekey(m3)]].size, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, fs[ri[inodekey(m3)]].directory ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m6 = fs[ri[inodekey(m3)]].size ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2 ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar3 → boolvar0) ∧ mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1) = old_inode ∧ mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1) = new_inode ∧ mkinode(m, md, boolvar1, m0, m1, m2) = old_dent_inode ∧ mkinode(m3, md0, boolvar2, m10 + 1, m5, m6) = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ mkdentry(str0, m3) = old_dent1 ∧ err0 = err1), m3 = 0, m3 = ROOT_INO, m7 = 0, mkdentry(str, m) = mkdentry(str0, m3), fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ nd.dentry? → (key = nd.key ∧ m = nd.ino ↔ nd = dentrynode(key, m)); (elim) Used terms: fs[ri[dentrykey(m7, str0)]], key0, m3