[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 189 from proof inv-rmdir (previous step)

1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].nlink, adr4 = adr1, dentrykeys(inodekey(fs[ri[dentrykey(m0, str)]].ino), ri) = ∅, links(fs[ri[dentrykey(m0, str)]].ino, fs, ri) = ∅ ++ dentrykey(m0, str), m = fs[ri[dentrykey(m0, str)]].ino, m1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].nsubdirs, m2 = fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].size, m3 = fs[ri[inodekey(m0)]].nlink, m4 = fs[ri[inodekey(m0)]].nsubdirs, m5 = fs[ri[inodekey(m0)]].size, nd = inodenode(inodekey(m), md, true, 0, m1, m2), nd0 = dentrynode(dentrykey(m0, str), 0), nd1 = inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1), fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m0) ∈ ri, dentrykey(m0, str) ∈ ri, inodekey(fs[ri[dentrykey(m0, str)]].ino) ∈ ri, 1 ≤ fs[ri[inodekey(m0)]].size, 1 ≤ fs[ri[inodekey(m0)]].nsubdirs, m4 ≥ 1, m5 ≥ 1, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m0), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(m0, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1).meta, inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1).directory, inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1).nlink, inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1).nsubdirs, inodenode(inodekey(m0), md0, true, m3, m4 - 1, m5 - 1).size); c_inode0 := mkinode (m, inodenode(inodekey(m), md, true, 0, m1, m2).meta, inodenode(inodekey(m), md, true, 0, m1, m2).directory, inodenode(inodekey(m), md, true, 0, m1, m2).nlink, inodenode(inodekey(m), md, true, 0, m1, m2).nsubdirs, inodenode(inodekey(m), md, true, 0, m1, m2).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(m0, str)]].ino = ROOT_INO, fs[ri[inodekey(m0)]].nsubdirs = 0, fs[ri[inodekey(m0)]].size = 0, inodekey(m0) ∈ ro, inodekey(fs[ri[dentrykey(m0, str)]].ino) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 190:
1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].nlink, dentrykeys(inodekey(fs[ri[dentrykey(m0, str)]].ino), ri) = ∅, links(fs[ri[dentrykey(m0, str)]].ino, fs, ri) = ∅ ++ dentrykey(m0, str), fs[ri[dentrykey(m0, str)]].ino ≠ ROOT_INO, fs[ri[dentrykey(m0, str)]].ino ≠ 0, fs[ri[inodekey(m0)]].nsubdirs ≠ 0, fs[ri[inodekey(m0)]].size ≠ 0, m0 ≠ 0, fs[ri[inodekey(fs[ri[dentrykey(m0, str)]].ino)]].directory, fs[ri[inodekey(m0)]].directory, 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-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(fs[ri[dentrykey(m0, str)]].ino) ∈ ri, dentrykey(m0, str) ∈ ri, inodekey(m0) ∈ ri, 1 ≤ fs[ri[inodekey(m0)]].nsubdirs, 1 ≤ fs[ri[inodekey(m0)]].size, ¬ inodekey(fs[ri[dentrykey(m0, str)]].ino) ∈ ro, ¬ inodekey(m0) ∈ ro, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {ri0 := ri; ri1 := ri; ri2 := ri; ri3 := ri; ri4 := ri; ri5 := ri; aubifs_core_index_store#(inodekey(m0), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(m0, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(fs[ri5[dentrykey(m0, str)]].ino), adr, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_orphans_insert#(inodekey(fs[ri5[dentrykey(m0, str)]].ino), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, fs[ri2[inodekey(m0)]].nlink, fs[ri1[inodekey(m0)]].nsubdirs - 1, fs[ri0[inodekey(m0)]].size - 1).meta, inodenode(inodekey(m0), md0, true, fs[ri2[inodekey(m0)]].nlink, fs[ri1[inodekey(m0)]].nsubdirs - 1, fs[ri0[inodekey(m0)]].size - 1) .directory, inodenode(inodekey(m0), md0, true, fs[ri2[inodekey(m0)]].nlink, fs[ri1[inodekey(m0)]].nsubdirs - 1, fs[ri0[inodekey(m0)]].size - 1).nlink, inodenode(inodekey(m0), md0, true, fs[ri2[inodekey(m0)]].nlink, fs[ri1[inodekey(m0)]].nsubdirs - 1, fs[ri0[inodekey(m0)]].size - 1) .nsubdirs, inodenode(inodekey(m0), md0, true, fs[ri2[inodekey(m0)]].nlink, fs[ri1[inodekey(m0)]].nsubdirs - 1, fs[ri0[inodekey(m0)]].size - 1).size); c_inode0 := mkinode (fs[ri5[dentrykey(m0, str)]].ino, inodenode (inodekey(fs[ri5[dentrykey(m0, str)]].ino), md, true, 0, fs[ri4[inodekey(fs[ri4[dentrykey(m0, str)]].ino)]].nsubdirs, fs[ri3[inodekey(fs[ri3[dentrykey(m0, str)]].ino)]].size) .meta, inodenode (inodekey(fs[ri5[dentrykey(m0, str)]].ino), md, true, 0, fs[ri4[inodekey(fs[ri4[dentrykey(m0, str)]].ino)]].nsubdirs, fs[ri3[inodekey(fs[ri3[dentrykey(m0, str)]].ino)]].size) .directory, inodenode (inodekey(fs[ri5[dentrykey(m0, str)]].ino), md, true, 0, fs[ri4[inodekey(fs[ri4[dentrykey(m0, str)]].ino)]].nsubdirs, fs[ri3[inodekey(fs[ri3[dentrykey(m0, str)]].ino)]].size) .nlink, inodenode (inodekey(fs[ri5[dentrykey(m0, str)]].ino), md, true, 0, fs[ri4[inodekey(fs[ri4[dentrykey(m0, str)]].ino)]].nsubdirs, fs[ri3[inodekey(fs[ri3[dentrykey(m0, str)]].ino)]].size) .nsubdirs, inodenode (inodekey(fs[ri5[dentrykey(m0, str)]].ino), md, true, 0, fs[ri4[inodekey(fs[ri4[dentrykey(m0, str)]].ino)]].nsubdirs, fs[ri3[inodekey(fs[ri3[dentrykey(m0, str)]].ino)]].size) .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: ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ inodekey(m).inode?; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)