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

fs[ri[dentrykey(ino, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, adr4 = adr1, 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, m4 = fs[ri[inodekey(m3)]].nlink, m5 = fs[ri[inodekey(m3)]].nsubdirs, m6 = fs[ri[inodekey(m3)]].size, nd = inodenode(inodekey(m), md, false, m0 + 1, m1, m2), nd0 = dentrynode(dentrykey(m3, str0), m), nd1 = inodenode(inodekey(m3), md0, true, m4, m5, m6 + 1), fs[ri[dentrykey(ino0, str)]].dentry?, fs[ri[inodekey(ino0)]].directory, fs[ri[inodekey(m3)]].directory, fs[ri[inodekey(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), dentrykey(ino0, str) ∈ ri, inodekey(m3) ∈ ri, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ 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, fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m3), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m3, 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 (m3, inodenode(inodekey(m3), md0, true, m4, m5, m6 + 1).meta, inodenode(inodekey(m3), md0, true, m4, m5, m6 + 1).directory, inodenode(inodekey(m3), md0, true, m4, m5, m6 + 1).nlink, inodenode(inodekey(m3), md0, true, m4, m5, m6 + 1).nsubdirs, inodenode(inodekey(m3), md0, true, m4, m5, m6 + 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)), fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, inodekey(ino) ∈ ro, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ro, dentrykey(m3, str0) ∈ ri, inodekey(m3) ∈ ro, inodekey(ino0) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 150:
fs[ri[dentrykey(ino, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, fs[ri[dentrykey(ino0, str)]].ino ≠ 0, m3 ≠ 0, fs[ri[dentrykey(ino0, str)]].dentry?, fs[ri[inodekey(ino)]].directory, fs[ri[inodekey(m3)]].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-cons(ri, fs), 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(m3) ∈ ri, dentrykey(ino0, str) ∈ ri, ¬ fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, ¬ inodekey(ino0) ∈ ro, ¬ inodekey(m3) ∈ ro, ¬ dentrykey(m3, str0) ∈ ri, ¬ inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ro, ¬ inodekey(ino) ∈ ro, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, fs[ri[inodekey(ino0)]].nlink ≠ 0 ∨ ino0 = 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(m3), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m3, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(fs[ri5[dentrykey(ino0, str)]].ino), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, fs[ri5[dentrykey(ino0, str)]].ino); p_inode0 := mkinode (m3, inodenode(inodekey(m3), md0, true, fs[ri2[inodekey(m3)]].nlink, fs[ri1[inodekey(m3)]].nsubdirs, fs[ri0[inodekey(m3)]].size + 1).meta, inodenode(inodekey(m3), md0, true, fs[ri2[inodekey(m3)]].nlink, fs[ri1[inodekey(m3)]].nsubdirs, fs[ri0[inodekey(m3)]].size + 1).directory, inodenode(inodekey(m3), md0, true, fs[ri2[inodekey(m3)]].nlink, fs[ri1[inodekey(m3)]].nsubdirs, fs[ri0[inodekey(m3)]].size + 1).nlink, inodenode(inodekey(m3), md0, true, fs[ri2[inodekey(m3)]].nlink, fs[ri1[inodekey(m3)]].nsubdirs, fs[ri0[inodekey(m3)]].size + 1).nsubdirs, inodenode(inodekey(m3), md0, true, fs[ri2[inodekey(m3)]].nlink, fs[ri1[inodekey(m3)]].nsubdirs, fs[ri0[inodekey(m3)]].size + 1).size); c_inode0 := mkinode (fs[ri5[dentrykey(ino0, str)]].ino, inodenode (inodekey(fs[ri5[dentrykey(ino0, str)]].ino), md, false, fs[ri4[inodekey(fs[ri4[dentrykey(ino0, str)]].ino)]].nlink + 1, fs[ri3[inodekey(fs[ri3[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) .meta, inodenode (inodekey(fs[ri5[dentrykey(ino0, str)]].ino), md, false, fs[ri4[inodekey(fs[ri4[dentrykey(ino0, str)]].ino)]].nlink + 1, fs[ri3[inodekey(fs[ri3[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) .directory, inodenode (inodekey(fs[ri5[dentrykey(ino0, str)]].ino), md, false, fs[ri4[inodekey(fs[ri4[dentrykey(ino0, str)]].ino)]].nlink + 1, fs[ri3[inodekey(fs[ri3[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) .nlink, inodenode (inodekey(fs[ri5[dentrykey(ino0, str)]].ino), md, false, fs[ri4[inodekey(fs[ri4[dentrykey(ino0, str)]].ino)]].nlink + 1, fs[ri3[inodekey(fs[ri3[dentrykey(ino0, str)]].ino)]].nsubdirs, m2) .nsubdirs, inodenode (inodekey(fs[ri5[dentrykey(ino0, str)]].ino), md, false, fs[ri4[inodekey(fs[ri4[dentrykey(ino0, str)]].ino)]].nlink + 1, fs[ri3[inodekey(fs[ri3[dentrykey(ino0, str)]].ino)]].nsubdirs, 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: ⊦ 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)