[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 32 from proof inv-rename-new-reparent (previous step)

m2 = fs[ri[inodekey(m)]].nlink, m3 = fs[ri[inodekey(m)]].nsubdirs, m5 = fs[ri[inodekey(m)]].size, m5 = m1 + 1, new_parent_inode = mkinode(m0, md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].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), 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, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, (boolvar2 ⊃ 1;0) ≤ fs[ri[inodekey(m)]].nsubdirs, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ 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 ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(m, old_dent.name), 0), dentrynode(dentrykey(new_parent_inode.ino, str0), old_dent.ino), inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1), inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, old_dent.name), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(new_parent_inode.ino, str0), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(new_parent_inode.ino), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).meta, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).directory, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).nlink, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).nsubdirs, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).size); new_parent_inode0 := mkinode (new_parent_inode.ino, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .meta, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .directory, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .nlink, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .nsubdirs, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .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[inodekey(m)]].size = 0, m0 = m, m5 = 0, inodekey(m0) ∈ ro, dentrykey(m0, str0) ∈ ri, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 33:
m1 + 1 = fs[ri[inodekey(m)]].size, m2 = fs[ri[inodekey(m)]].nlink, m3 = fs[ri[inodekey(m)]].nsubdirs, new_parent_inode = mkinode(m0, md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), m0 ≠ m, fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].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), 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, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, (boolvar2 ⊃ 1;0) ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ inodekey(m0) ∈ ro, ¬ dentrykey(m0, str0) ∈ ri, ¬ inodekey(m) ∈ ro, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ 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 ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(m, old_dent.name), 0), dentrynode(dentrykey(new_parent_inode.ino, str0), old_dent.ino), inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1), inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, old_dent.name), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(new_parent_inode.ino, str0), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(new_parent_inode.ino), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).meta, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).directory, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).nlink, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).nsubdirs, inodenode(inodekey(m), md, true, m2, m3 - (boolvar2 ⊃ 1;0), m1).size); new_parent_inode0 := mkinode (new_parent_inode.ino, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .meta, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .directory, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .nlink, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .nsubdirs, inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs + (boolvar2 ⊃ 1;0), new_parent_inode.size + 1) .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))

Rule argument

Additional information

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