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

fs0[ri0[dentrykey(ino1, str)]].ino = fs0[ri0[dentrykey(ino0, str)]].ino, fs0[ri0[dentrykey(ino, str)]].ino = fs0[ri0[dentrykey(ino0, str)]].ino, 0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nsubdirs, adr = adr1, dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), fs = fs0[adr1, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str0), fs0[ri0[dentrykey(ino0, str)]].ino) ] [adr3, inodenode(inodekey(fs0[ri0[dentrykey(ino0, str)]].ino), md0, false, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink + 1, 0, m6) ], key = inodekey(m), log = ((log0 + adr1 ') + adr2 ') + adr3 ', m0 = fs0[ri0[inodekey(m)]].nlink, m1 = fs0[ri0[inodekey(m)]].nsubdirs, m2 = fs0[ri0[inodekey(m)]].size, m3 = fs0[ri0[dentrykey(ino0, str)]].ino, m4 = fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink, ri = ri0[key, adr], ro = orphans(fs0, ri0), ro0 = orphans(fs0, ri0), fs0[ri0[inodekey(ino0)]].directory, fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(ino1)]].directory, fs0[ri0[inodekey(ino)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(ino0, str) ∈ ri0, inodekey(ino0) ∈ ri0, inodekey(m) ∈ ri0, dentrykey(ino1, str) ∈ ri0, inodekey(fs0[ri0[dentrykey(ino0, str)]].ino) ∈ ri0, inodekey(ino1) ∈ ri0, inodekey(ino) ∈ ri0, dentrykey(ino, str) ∈ ri0, asynced → boolvar0, links(fs0[ri0[dentrykey(ino0, str)]].ino, abs-dirs(fs0, ri0)) ≠ ∅ ∨ fs0[ri0[dentrykey(ino0, str)]].ino = ROOT_INO, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO, links(ino0, abs-dirs(fs0, ri0)) ≠ ∅ ∨ ino0 = ROOT_INO, fs0[ri0[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs0[ri0[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs0[ri0[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink ≠ 0 ∨ fs0[ri0[dentrykey(ino0, str)]].ino = ROOT_INO ⊦ [aubifs_core_index_store#(dentrykey(m, str0), adr2, fi, ro0, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); aubifs_core_index_store#(inodekey(m3), adr3, fi, ro0, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); new_dent := mkdentry(str0, m3); p_inode := mkinode (m, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).meta, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).directory, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nlink, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nsubdirs, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).size); c_inode := mkinode (m3, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).meta, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).directory, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nlink, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nsubdirs, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).size)] ( ubifs-cons(fs, ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong(fs, ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log0, fs) ∧ adr1 ∈ fs ∧ node-cons(fs[adr1].key, fs[adr1]) ∧ adr2 ∈ fs ∧ node-cons(fs[adr2].key, fs[adr2]) ∧ adr3 ∈ fs ∧ node-cons(fs[adr3].key, fs[adr3]) → ⟨old_dent0 := negdentry(str0); p_inode0 := mkinode(m, md, true, m0, m1, m2); p_inode1 := mkinode(m3, md0, false, m4, 0, m6); afs_link#(mkdentry(str, m3); p_inode0, p_inode1, old_dent0, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ ESUCCESS = err0)), fs0[ri0[dentrykey(ino0, str)]].ino = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].directory, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, dentrykey(m, str0) ∈ ri0, fs0[ri0[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO, fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO, fs0[ri0[inodekey(fs0[ri0[dentrykey(ino0, str)]].ino)]].nlink = 0 ∧ fs0[ri0[dentrykey(ino0, str)]].ino ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (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)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ adr ∈ fs[adr0, nd] ↔ adr = adr0 ∨ adr ∈ fs; (ws)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)