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

m5 + 1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str)]].ino)]].nlink, 0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str)]].ino)]].nsubdirs, 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, str), 0) ] [adr3, inodenode(inodekey(fs0[ri0[dentrykey(m, str)]].ino), md0, false, m5, 0, m6) ], key = dentrykey(m, mkdentry(str, fs0[ri0[dentrykey(m, str)]].ino).name), log = ((log0 + adr1 ') + adr2 ') + adr3 ', ri = ri0[inodekey(m), adr1], ro = orphans(fs0, ri0), fs0[ri0[dentrykey(m, str)]].dentry?, fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m)]].inode?, 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), ri0[inodekey(m)] ∈ fs0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m) ∈ ri0, inodekey(fs0[ri0[dentrykey(m, str)]].ino) ∈ ri0, dentrykey(m, str) ∈ ri0, 1 ≤ fs0[ri0[inodekey(m)]].size, fs0[ri0[inodekey(m)]].size ≥ 1, asynced → boolvar0, m5 = 0 → links(fs0[ri0[dentrykey(m, str)]].ino, fs0, ri0) = ∅ ++ dentrykey(m, str), fs0[ri0[inodekey(m)]].trunc? ∨ fs0[ri0[inodekey(m)]].inode?, fs0[ri0[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO ⊦ [ri := ri -- key; aubifs_core_index_store# (inodekey(fs0[ri0[dentrykey(m, str)]].ino), adr3, fi, orphans(fs0, ri0), fo, 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, str), 0) ] [adr3, inodenode(inodekey(fs0[ri0[dentrykey(m, str)]].ino), md0, false, m5, 0, m6) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); m4 := m5 + 1; log := ((log0 + adr1 ') + adr2 ') + adr3 '; ro0 := orphans(fs0, ri0); m3 := fs0[ri0[dentrykey(m, str)]].ino; 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, str), 0) ] [adr3, inodenode(inodekey(fs0[ri0[dentrykey(m, str)]].ino), md0, false, m5, 0, m6) ]; if m4 = 1 then aubifs_core_orphans_insert#(inodekey(m3), ri, fi, fo, fs, log, boolvar; ro0); dent := negdentry(mkdentry(str, fs0[ri0[dentrykey(m, str)]].ino).name); p_inode := mkinode (m, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size - 1).meta, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size - 1).directory, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size - 1).nlink, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size - 1).nsubdirs, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size - 1).size); c_inode := mkinode (m3, inodenode(inodekey(m3), md0, false, m5, 0, m6).meta, inodenode(inodekey(m3), md0, false, m5, 0, m6).directory, inodenode(inodekey(m3), md0, false, m5, 0, m6).nlink, inodenode(inodekey(m3), md0, false, m5, 0, m6).nsubdirs, inodenode(inodekey(m3), md0, false, m5, 0, m6).size)] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟨old_dent := mkdentry(str, m3); p_inode0 := mkinode(m, md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size); p_inode1 := mkinode(m3, md0, false, m4, 0, m6); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_unlink#(; p_inode0, p_inode1, old_dent, 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 ∧ dent = old_dent ∧ ESUCCESS = err0)), fs0[ri0[dentrykey(m, str)]].ino = 0, fs0[ri0[dentrykey(m, str)]].ino = ROOT_INO, fs0[ri0[inodekey(m)]].size = 0, adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str)]].ino)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information