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

p_inode.nlink = fs[ri[inodekey(p_inode.ino)]].nlink, p_inode.nsubdirs = fs[ri[inodekey(p_inode.ino)]].nsubdirs, p_inode.size = fs[ri[inodekey(p_inode.ino)]].size, 1 = fs[ri[inodekey(m)]].nlink, boolvar0, c_inode = mkinode(m, md, boolvar0, m0, m1, m2), dentrykeys(inodekey(m), ri) = ∅, links(m, fs, ri) = ∅ ++ dentrykey(p_inode.ino, str), m = fs[ri[dentrykey(p_inode.ino, str)]].ino, m0 = 1, m1 = fs[ri[inodekey(m)]].nsubdirs, m2 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(p_inode.ino)]].directory, p_inode.directory, fs[ri[inodekey(m)]].directory, 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), dentrykey(p_inode.ino, str) ∈ ri, inodekey(m) ∈ ri, inodekey(p_inode.ino) ∈ ri, 1 ≤ p_inode.nsubdirs, 1 ≤ p_inode.size, p_inode.size ≥ 1, p_inode.nsubdirs ≥ 1, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO ⊦ ⟪aubifs_core_journal_add3# (inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1), dentrynode(dentrykey(p_inode.ino, str), 0), inodenode(inodekey(m), md, boolvar0, 0, m1, m2), ri, fi, ro, fo ; adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(p_inode.ino, 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 (p_inode.ino, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).meta, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).directory, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nlink, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nsubdirs, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).size); c_inode0 := mkinode (m, inodenode(inodekey(m), md, boolvar0, 0, m1, m2).meta, inodenode(inodekey(m), md, boolvar0, 0, m1, m2).directory, inodenode(inodekey(m), md, boolvar0, 0, m1, m2).nlink, inodenode(inodekey(m), md, boolvar0, 0, m1, m2).nsubdirs, inodenode(inodekey(m), md, boolvar0, 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)), p_inode.nsubdirs = 0, p_inode.size = 0, m = ROOT_INO, inodekey(p_inode.ino) ∈ ro, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 17:
p_inode.nlink = fs[ri[inodekey(p_inode.ino)]].nlink, p_inode.nsubdirs = fs[ri[inodekey(p_inode.ino)]].nsubdirs, p_inode.size = fs[ri[inodekey(p_inode.ino)]].size, 1 = fs[ri[inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino)]].nlink, dentrykeys(inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino), ri) = ∅, links(fs[ri[dentrykey(p_inode.ino, str)]].ino, fs, ri) = ∅ ++ dentrykey(p_inode.ino, str), m = fs[ri[dentrykey(p_inode.ino, str)]].ino, m1 = fs[ri[inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino)]].nsubdirs, m2 = fs[ri[inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino)]].size, fs[ri[dentrykey(p_inode.ino, str)]].ino ≠ ROOT_INO, p_inode.nsubdirs ≠ 0, p_inode.size ≠ 0, fs[ri[inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino)]].directory, p_inode.directory, fs[ri[inodekey(p_inode.ino)]].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-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(p_inode.ino) ∈ ri, inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino) ∈ ri, dentrykey(p_inode.ino, str) ∈ ri, 1 ≤ p_inode.nsubdirs, 1 ≤ p_inode.size, ¬ inodekey(fs[ri[dentrykey(p_inode.ino, str)]].ino) ∈ ro, ¬ inodekey(p_inode.ino) ∈ ro, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO ⊦ ⟪aubifs_core_journal_add3# (inodenode(inodekey(p_inode.ino), p_inode.meta, true, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1), dentrynode(dentrykey(p_inode.ino, str), 0), inodenode(inodekey(m), md, true, 0, m1, m2), ri, fi, ro, fo ; adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(p_inode.ino, 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 (p_inode.ino, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).meta, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).directory, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nlink, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nsubdirs, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 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))

Rule argument

Additional information

Used simplifier rules: ⊦ #(∅ ++ key) = 1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)%one-size: ⊦ ks = ∅ ++ key → # ks = 1; (forward) from specification set-basic[node-index]% ⊦ n ≥ m ↔ m ≤ n; (s)