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

adr = adr2, fs = fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], key = dentrykey(m, str), log = ((log0 + adr1 ') + adr2 ') + adr3 ', ri = ri1[inodekey(m), adr1], fs1[ri1[inodekey(m)]].directory, fs1[ri1[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs1, ri1), log-cons(log0, fs1), orphans-cons(fs1, ri1, ro), replay-cons-strong(fs1, ri1, ro, fi, fo, log0), ri-inj(fi), ri-inj(ri1), ubifs-cons(fs1, ri1, ro, fi, fo, log0), ri1[inodekey(m)] ∈ fs1, inodekey(m) ∈ ri1, fs1[ri1[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs1[ri1[inodekey(m)]].trunc? ∨ fs1[ri1[inodekey(m)]].inode? ⊦ ⟪ri[key] := adr; aubifs_core_index_store# (inodekey(n), adr3, fi, ro, fo, fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); dent := mkdentry(str, n); p_inode := mkinode (mkinode(m, md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size).ino, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1).meta, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1).directory, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1).nlink, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1).nsubdirs, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1).size); c_inode := mkinode (n, inodenode(inodekey(n), md, false, 1, 0, 0).meta, inodenode(inodekey(n), md, false, 1, 0, 0).directory, inodenode(inodekey(n), md, false, 1, 0, 0).nlink, inodenode(inodekey(n), md, false, 1, 0, 0).nsubdirs, inodenode(inodekey(n), md, false, 1, 0, 0).size)⟫ ( ubifs-cons (fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri) ∧ orphans-cons (fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri1[inodekey(m)]].nlink, fs1[ri1[inodekey(m)]].nsubdirs, fs1[ri1[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro)), adr1 = adr2, adr1 = adr3, adr2 = adr3, n = 0, adr3 ∈ fs1, adr2 ∈ fs1, adr1 ∈ fs1, inodekey(n) ∈ ri1, inodekey(n) ∈ fo, dentrykey(m, str) ∈ ri1, inodekey(m) ∈ ro

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information