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

fs1[ri[inodekey(m3)]] = inodenode(key, md1, true, m, m4, m5), dirs = abs-dirs(fs1, ri), files = abs-files(fs1, ri), mkinode (m3, md0, true, inodenode(key, md1, true, m, m4, m5).nlink, inodenode(key, md1, true, m, m4, m5).nsubdirs, inodenode(key, md1, true, m, m4, m5).size) = mkinode(m0, md2, boolvar1, m1, m2, m6), ri0 = ri, ro0 = orphans(fs1, ri), orphans(fs1, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs1, ri), abs-files(fs1, ri)), file-node-cons(fs1, ri), log-cons(log0, fs1), orphans-cons(fs1, ri, orphans(fs1, ri)), replay-cons-strong(fs1, ri, orphans(fs1, ri), fi, fo, log0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs1, ri, orphans(fs1, ri), fi, fo, log0), inodekey(m3) ∈ ri, ri[inodekey(m3)] ∈ fs1, asynced → boolvar0, links(m3, abs-dirs(fs1, ri)) ≠ ∅ ∨ m3 = ROOT_INO, m ≠ 0 ∨ m3 = ROOT_INO ⊦ [aubifs_core_index_store# (inodekey(m0), adr1, fi, orphans(fs1, ri), fo, fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); aubifs_core_index_store# (dentrykey(m0, str), adr2, fi, orphans(fs1, ri0), fo, fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); aubifs_core_index_store# (inodekey(n), adr3, fi, orphans(fs1, ri0), fo, fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar ; ri); dent := mkdentry(str, n); p_inode := mkinode (m0, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1).meta, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1).directory, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1).nlink, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1).nsubdirs, inodenode(inodekey(m3), md0, true, m, m4, m5 + 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(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri) ∧ orphans-cons (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri, ro0) ∧ ri-inj(ri) ∧ log-cons (log0, fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ]) ∧ m3 ≠ 0 → ⟨old_dent := negdentry(str); p_inode0 := mkinode (m3, md0, true, inodenode(key, md1, true, m, m4, m5).nlink, inodenode(key, md1, true, m, m4, m5).nsubdirs, inodenode(key, md1, true, m, m4, m5).size); afs_create#(md; p_inode0, p_inode1, old_dent, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri) ∧ files = abs-files (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri) ∧ orphans (abs-dirs (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri), abs-files (fs1[adr1, inodenode(inodekey(m3), md0, true, m, m4, m5 + 1)][adr2, dentrynode(dentrykey(m3, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri)) = abs-keys(ro0) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ dent = old_dent ∧ ESUCCESS = err0)), adr1 = adr3, adr1 = adr2, adr2 = adr3, n = 0, dentrykey(m3, str) ∈ ri, inodekey(n) ∈ fo, inodekey(n) ∈ ri, adr1 ∈ fs1, adr2 ∈ fs1, adr3 ∈ fs1, m = 0 ∧ m3 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)%⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nsubdirs = m0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)