Proof step 509 from proof inv-rename-overwrite-keep-parent (previous step)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

• Proof step 510:

  boolvar ↔ old_dent = new_dent, boolvar1 ↔ old_child_inode.directory, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, boolvar1 ↔ boolvar3, boolvar, key = inodekey(new_dent.ino), key0 = inodekey(parent_inode.ino), new_child_inode = mkinode (fs[ri[dentrykey(m, str0)]].ino, md1, boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nsubdirs, m6), new_dent = mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), old_child_inode = mkinode (fs[ri[dentrykey(m, str)]].ino, md0, boolvar3, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, m3), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), old_dent.dentry?, fs[ri[dentrykey(m, str)]].dentry?, new_dent.dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), pre-rename-overwrite-keep-parent(parent_inode, old_dent, old_child_inode, new_dent, new_child_inode, fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str0) ∈ ri, inodekey(fs[ri[dentrykey(m, str0)]].ino) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, boolvar3 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m, str0), fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m, str0)]].ino), ri) = ∅, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar3 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar3 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].size ⊦ ⟪nd := inodenode(key, new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink, new_child_inode.nsubdirs, new_child_inode.size); aubifs_core_journal_add4# (dentrynode(dentrykey(parent_inode.ino, old_dent.name), 0), dentrynode(dentrykey(parent_inode.ino, new_dent.name), old_dent.ino), inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size), nd, ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar0, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(parent_inode.ino, old_dent.name), fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(dentrykey(parent_inode.ino, new_dent.name), adr1, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar0; ro); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); parent_inode0 := mkinode (parent_inode.ino, inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size).meta, inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size).directory, inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size).nlink, inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size).nsubdirs, inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size).size); new_child_inode := mkinode(new_child_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[dentrykey(m, str0)]].ino = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 0, fs[ri[inodekey(m)]].size = 0, inodekey(m) ∈ ro

Rule argument

Additional information