Proof step 17 from proof inv-rename-new-reparent (previous step)

Heuristic unfold applied rule call right

And obtained the following new goals

• Proof step 18:

  boolvar0 ↔ boolvar2, boolvar ↔ boolvar1, new_dent = negdentry(str0), new_parent_inode = mkinode(m0, md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), old_child_inode = mkinode (fs[ri[dentrykey(m, str)]].ino, md1, boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, m4), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), old_parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(m0) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar2 ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪if pre-rename-new-reparent(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, fs, ri, ro) ∧ (boolvar0 ↔ old_child_inode.directory) then choose key2, key1, key0, key, nd2, nd1, nd0, nd, adr2, adr1, adr0, adr with true in {key2 := dentrykey(old_parent_inode.ino, old_dent.name); nd2 := dentrynode(key2, 0); key1 := dentrykey(new_parent_inode.ino, new_dent.name); nd1 := dentrynode(key1, old_dent.ino); key0 := inodekey(old_parent_inode.ino); nd0 := inodenode (key0, old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1); key := inodekey(new_parent_inode.ino); nd := inodenode (key, new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar0 ⊃ 1;0), new_parent_inode.size + 1); aubifs_core_journal_add4#(nd2, nd1, nd0, nd, ri, fi, ro, fo; adr2, adr1, adr0, adr, fs, log; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(key2, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key1, adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode(old_parent_inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); new_parent_inode := mkinode(new_parent_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}} else abort⟫ (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[inodekey(m)]].size = 0, m0 = m, inodekey(m) ∈ ro, dentrykey(m0, str0) ∈ ri, inodekey(m0) ∈ ro

Rule argument

Additional information

Used simplifier rules: rename-new-reparent: ⊦ ;%dentry-ubifs-cons: ⊦ dentrykey(ino, str) ∈ ri ∧ ri[dentrykey(ino, str)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[dentrykey(ino, str)]].dentry?;%inode-ubifs-cons: ⊦ inodekey(ino) ∈ ri ∧ ri[inodekey(ino)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].inode?;% ⊦ key ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ri[key] ∈ fs; (ss)