Proof step 9 from proof refine-rename-new-reparent (previous step)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

• Proof step 10:

  new_inode.nlink = fs[ri[inodekey(new_inode.ino)]].nlink, old_inode.nlink = fs[ri[inodekey(old_inode.ino)]].nlink, new_inode.nsubdirs = fs[ri[inodekey(new_inode.ino)]].nsubdirs, old_inode.nsubdirs = fs[ri[inodekey(old_inode.ino)]].nsubdirs, new_inode.size = fs[ri[inodekey(new_inode.ino)]].size, old_inode.size = fs[ri[inodekey(old_inode.ino)]].size, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(old_inode.ino, str)]].ino, new_dent = negdentry(str0), new_parent_inode = new_inode, old_dent = mkdentry(str, m), old_dent_inode = mkinode(m, md, boolvar1, m0, m1, m2), old_parent_inode = old_inode, ro = orphans(fs, ri), new_inode.directory, old_inode.directory, fs[ri[inodekey(old_inode.ino)]].directory, fs[ri[inodekey(new_inode.ino)]].directory, orphans(fs, ri).inodes?, fo.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-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, dentrykey(old_inode.ino, str) ∈ ri, inodekey(old_inode.ino) ∈ ri, inodekey(new_inode.ino) ∈ ri, 1 ≤ old_inode.size, boolvar1 → 1 ≤ old_inode.nsubdirs, boolvar → boolvar0, old_inode.nlink ≠ 0 ∨ old_inode.ino = ROOT_INO, new_inode.nlink ≠ 0 ∨ new_inode.ino = ROOT_INO, links(old_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ old_inode.ino = ROOT_INO, links(new_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_inode.ino = 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 ∧ 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 ⊦ ⟪aubifs_rename_new_reparent# (boolvar1, old_dent_inode, fi, orphans(fs, ri), fo; old_parent_inode, new_parent_inode, old_dent, new_dent, err, ri, fs, log, boolvar0)⟫ ⟨old_dent_inode0 := old_dent_inode; new_dent_inode0 := new_dent_inode; old_dent0 := mkdentry(str, m); old_dent1 := negdentry(str0); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (boolvar → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0), old_inode.ino = new_inode.ino, old_inode.size = 0, dentrykey(new_inode.ino, str0) ∈ ri, new_inode.nlink = 0 ∧ new_inode.ino ≠ ROOT_INO, old_inode.nlink = 0 ∧ old_inode.ino ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim) Used terms: old_dent_inode, m, md, boolvar1, m0, m1, m2