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

fs[ri[dentrykey(ino, str)]].ino = m, 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, ¬ boolvar0, c_inode = mkinode(m, md, boolvar0, m0, m1, m2), m = fs[ri[dentrykey(ino0, str)]].ino, m0 = fs[ri[inodekey(m)]].nlink, m1 = fs[ri[inodekey(m)]].nsubdirs, fs[ri[dentrykey(ino0, str)]].dentry?, fs[ri[inodekey(ino0)]].directory, fs[ri[inodekey(p_inode.ino)]].directory, p_inode.directory, fs[ri[inodekey(ino)]].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(ino0, str) ∈ ri, inodekey(p_inode.ino) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, inodekey(ino) ∈ ri, dentrykey(ino, str) ∈ ri, inodekey(ino0) ∈ ri, fs[ri[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ ⟪aubifs_core_journal_add3# (inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1), dentrynode(dentrykey(p_inode.ino, str0), m), inodenode(inodekey(m), md, boolvar0, m0 + 1, 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_store#(dentrykey(p_inode.ino, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, m); p_inode0 := mkinode (p_inode.ino, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).meta, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).directory, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).nlink, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).nsubdirs, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).size); c_inode0 := mkinode (m, inodenode(inodekey(m), md, boolvar0, m0 + 1, m1, m2).meta, inodenode(inodekey(m), md, boolvar0, m0 + 1, m1, m2).directory, inodenode(inodekey(m), md, boolvar0, m0 + 1, m1, m2).nlink, inodenode(inodekey(m), md, boolvar0, m0 + 1, m1, m2).nsubdirs, inodenode(inodekey(m), md, boolvar0, m0 + 1, 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[inodekey(m)]].directory, inodekey(ino) ∈ ro, inodekey(m) ∈ ro, dentrykey(p_inode.ino, str0) ∈ ri, inodekey(p_inode.ino) ∈ ro, inodekey(ino0) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 19:
fs[ri[dentrykey(ino, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, 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, m = fs[ri[dentrykey(ino0, str)]].ino, m0 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink, m1 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nsubdirs, fs[ri[dentrykey(ino0, str)]].dentry?, fs[ri[inodekey(ino)]].directory, p_inode.directory, fs[ri[inodekey(p_inode.ino)]].directory, fs[ri[inodekey(ino0)]].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(ino0) ∈ ri, dentrykey(ino, str) ∈ ri, inodekey(ino) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ri, inodekey(p_inode.ino) ∈ ri, dentrykey(ino0, str) ∈ ri, ¬ fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, ¬ inodekey(ino0) ∈ ro, ¬ inodekey(p_inode.ino) ∈ ro, ¬ dentrykey(p_inode.ino, str0) ∈ ri, ¬ inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ro, ¬ inodekey(ino) ∈ ro, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO, fs[ri[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = ROOT_INO ⊦ ⟪aubifs_core_journal_add3# (inodenode(inodekey(p_inode.ino), p_inode.meta, true, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1), dentrynode(dentrykey(p_inode.ino, str0), m), inodenode(inodekey(m), md, false, m0 + 1, 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_store#(dentrykey(p_inode.ino, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, m); p_inode0 := mkinode (p_inode.ino, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).meta, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).directory, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).nlink, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).nsubdirs, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs, p_inode.size + 1).size); c_inode0 := mkinode (m, inodenode(inodekey(m), md, false, m0 + 1, m1, m2).meta, inodenode(inodekey(m), md, false, m0 + 1, m1, m2).directory, inodenode(inodekey(m), md, false, m0 + 1, m1, m2).nlink, inodenode(inodekey(m), md, false, m0 + 1, m1, m2).nsubdirs, inodenode(inodekey(m), md, false, m0 + 1, 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: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)