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

fs0[ri0[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs0, ri0)), fs0[ri0[inodekey(ino)]].nsubdirs = # subdirs(ino, abs-dirs(fs0, ri0)), fs0[ri0[inodekey(ino)]].size = # abs-children(ino, fs0, ri0), abs-files(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2])[ino] = mkfile(m5, md2, m6, content0), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))] = abs-files (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), fs0[ri0[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), abs-dirs(fs0, ri0) = abs-dirs(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2]), fs0[ri0[inodekey(ino)]].directory, fs0[ri0[inodekey(ROOT_INO)]].directory, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))]), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), inodekey(ino) ∈ ri0, inodekey(ROOT_INO) ∈ ri0, inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, # links(ino, abs-dirs(fs0, ri0)) ≤ 1, dentrykey(ino, name) ∈ ri0 → inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory ∨ inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, asynced0 → boolvar0, ino ≠ ROOT_INO ∧ links(ino, abs-dirs(fs0, ri0)) = ∅ → abs-children(ino, fs0, ri0) = ∅ ⊦ adr1 = adr2, ino = m, m = 0, orphans (abs-dirs(fs0, ri0), abs-files(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2])) = abs-keys(orphans(fs0, ri0)), adr2 ∈ fs0, adr1 ∈ fs0, ( ¬ inodekey(ino) ∈ ri0[inodekey(m), adr2] ∨ (adr2 = ri0[inodekey(ino)] ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = ri0[inodekey(ino)] ⊃ truncnode(inodekey(m), min(n0, m2));fs0[ri0[inodekey(ino)]]) ) .directory) ∧ ( dentrykey(ino, name) ∈ ri0 → inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory ∨ inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0[inodekey(m), adr2] ∧ ¬ (adr2 = (m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]) ⊃ truncnode(inodekey(m), min(n0, m2)) ;fs0[(m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)])] ) ) .directory) ∧ ( inodekey(ino) ∈ ri0[inodekey(m), adr2] ∧ ¬ (adr2 = ri0[inodekey(ino)] ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = ri0[inodekey(ino)] ⊃ truncnode(inodekey(m), min(n0, m2));fs0[ri0[inodekey(ino)]]) ) .directory ∧ n ∈ content0 → # content0[n] = VFS_PAGE_SIZE), m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ (datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0 ∨ buf-opt0.some?), m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 1390:
fs0[ri0[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs0, ri0)), fs0[ri0[inodekey(ino)]].nsubdirs = # subdirs(ino, abs-dirs(fs0, ri0)), fs0[ri0[inodekey(ino)]].size = # abs-children(ino, fs0, ri0), fs0[ri0[inodekey(m)]] = inodenode(key, md0, false, m0, 0, m3), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))] = abs-files (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), abs-files(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2])[ino] = mkfile(m5, md2, m6, content0), abs-dirs(fs0, ri0) = abs-dirs(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2]), fs0[ri0[inodekey(ROOT_INO)]].directory, fs0[ri0[inodekey(ino)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)[m, mkfile(n0, md, m0, abs-content(m, fs0, ri0) upto min(n0, m2))]), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2])), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2] \ datakeys(inodekey(m), min(n0, m2), ri0[inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, (log0 + adr1 ') + adr2 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, inodekey(ROOT_INO) ∈ ri0, inodekey(ino) ∈ ri0, # links(ino, abs-dirs(fs0, ri0)) ≤ 1, ino ≠ ROOT_INO ∧ links(ino, abs-dirs(fs0, ri0)) = ∅ → abs-children(ino, fs0, ri0) = ∅, asynced0 → boolvar0, buf-opt0.some? → # buf-opt0.buf = VFS_PAGE_SIZE, dentrykey(ino, name) ∈ ri0 → inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory ∨ inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory ⊦ adr1 = adr2, adr2 = ri0[inodekey(ino)], ino = m, m = 0, orphans (abs-dirs(fs0, ri0), abs-files(fs0[adr1, truncnode(inodekey(m), min(n0, m2))][adr2, inodenode(inodekey(m), md, false, m0, 0, n0)], ri0[inodekey(m), adr2])) = abs-keys(orphans(fs0, ri0)), adr1 ∈ fs0, adr2 ∈ fs0, m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0, m2 ≤ n0 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ (datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0 ∨ buf-opt0.some?), ( ¬ inodekey(ino) ∈ ri0[inodekey(m), adr2] ∨ (adr2 = ri0[inodekey(ino)] ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = ri0[inodekey(ino)] ⊃ truncnode(inodekey(m), min(n0, m2));fs0[ri0[inodekey(ino)]]) ) .directory) ∧ ( dentrykey(ino, name) ∈ ri0 → inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0 ∧ fs0[ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]].directory ∨ inodekey(fs0[ri0[dentrykey(ino, name)]].ino) ∈ ri0[inodekey(m), adr2] ∧ ¬ (adr2 = (m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]) ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = (m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)]) ⊃ truncnode(inodekey(m), min(n0, m2)) ;fs0[(m = fs0[ri0[dentrykey(ino, name)]].ino ⊃ adr2;ri0[inodekey(fs0[ri0[dentrykey(ino, name)]].ino)])] ) ) .directory) ∧ ( inodekey(ino) ∈ ri0[inodekey(m), adr2] ∧ ¬ (adr2 = ri0[inodekey(ino)] ⊃ inodenode(inodekey(m), md, false, m0, 0, n0) ;(adr1 = ri0[inodekey(ino)] ⊃ truncnode(inodekey(m), min(n0, m2));fs0[ri0[inodekey(ino)]]) ) .directory ∧ n ∈ content0 → # content0[n] = VFS_PAGE_SIZE)

Rule argument

fma: adr2 = ri0[inodekey(ino)]

Additional information

Used simplifier rules: ⊦ ¬ adr ∈ fs → fs[adr] = (∅)[adr]; (s)% ⊦ key ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ri[key] ∈ fs; (ss) Used formulas: adr2 = ri0[inodekey(ino)]