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

m = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, VFS_PAGE_SIZE = n0 + m4 % VFS_PAGE_SIZE, fs0[ri0[inodekey(m0)]] = inodenode(key1, md, false, m, m1, m2), fs0[ri0[datakey(m0, m4 / VFS_PAGE_SIZE)]] = datanode(datakey(m0, m4 / VFS_PAGE_SIZE), buf0), fs0[ri0[datakey(ino, n)]].data?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(ino) ∈ ri0, datakey(ino, n) ∈ ri0, ri0[datakey(ino, n)] ∈ fs0, ri0[datakey(m0, m4 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, inodekey(m0) ∈ ri0, m4 ≤ n1, ro ⊆ dom ri0, ino ≠ m0 ∨ ¬ m4 ≤ n * VFS_PAGE_SIZE ⊦ m4 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr1 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]), adr2 = adr3, adr3 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]), m0 = 0, fs0[ri0[inodekey(ino)]].directory, buf-opt.some?, adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, (adr3 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ datanode(datakey(m0, m4 / VFS_PAGE_SIZE), fill(buf0, zero, m4 % VFS_PAGE_SIZE, n0)) ;(adr2 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1) ;( adr1 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ truncnode(inodekey(m0), m4) ;fs0[(ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)]))] ) ) ) .data? ∧ ¬ (adr2 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1) ;(adr1 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ truncnode(inodekey(m0), m4);fs0[(m0 = ino ⊃ adr2;ri0[inodekey(ino)])]) ) .directory ∧ # ( adr3 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ datanode(datakey(m0, m4 / VFS_PAGE_SIZE), fill(buf0, zero, m4 % VFS_PAGE_SIZE, n0)) ;( adr2 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1) ;( adr1 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ truncnode(inodekey(m0), m4) ;fs0 [(ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ] ) ) ) .data = VFS_PAGE_SIZE

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 349:
m = 0 ∧ m0 ≠ ROOT_INO ↔ inodekey(m0) ∈ ro, VFS_PAGE_SIZE = n0 + m4 % VFS_PAGE_SIZE, fs0[ri0[datakey(m0, m4 / VFS_PAGE_SIZE)]] = datanode(datakey(m0, m4 / VFS_PAGE_SIZE), buf0), fs0[ri0[inodekey(m0)]] = inodenode(key1, md, false, m, m1, m2), fs0[ri0[datakey(ino, n)]].data?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m0) ∈ ri0, ri0[inodekey(m0)] ∈ fs0, datakey(m0, m4 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m0, m4 / VFS_PAGE_SIZE)] ∈ fs0, ri0[datakey(ino, n)] ∈ fs0, datakey(ino, n) ∈ ri0, inodekey(ino) ∈ ri0, m4 ≤ n1, ro ⊆ dom ri0, ino ≠ m0 ∨ ¬ m4 ≤ n * VFS_PAGE_SIZE ⊦ m4 % VFS_PAGE_SIZE = 0, adr1 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]), adr1 = adr3, adr1 = adr2, adr2 = adr3, adr3 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]), m0 = 0, fs0[ri0[inodekey(ino)]].directory, buf-opt.some?, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr3 ∈ ri0, (adr3 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ datanode(datakey(m0, m4 / VFS_PAGE_SIZE), fill(buf0, zero, m4 % VFS_PAGE_SIZE, n0)) ;(adr2 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1) ;( adr1 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ truncnode(inodekey(m0), m4) ;fs0[(ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)]))] ) ) ) .data? ∧ ¬ (adr2 = (m0 = ino ⊃ adr2;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1);fs0[(m0 = ino ⊃ adr2;ri0[inodekey(ino)])]).directory ∧ # ( adr3 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ datanode(datakey(m0, m4 / VFS_PAGE_SIZE), fill(buf0, zero, m4 % VFS_PAGE_SIZE, n0)) ;( adr2 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ inodenode(inodekey(m0), md0, false, m, m1, n1) ;( adr1 = (ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ⊃ truncnode(inodekey(m0), m4) ;fs0 [(ino = m0 ∧ m4 ≤ n * VFS_PAGE_SIZE ⊃ (∅)[datakey(m0, n)];(datakey(m0, m4 / VFS_PAGE_SIZE) = datakey(ino, n) ⊃ adr3;ri0[datakey(ino, n)])) ] ) ) ) .data = VFS_PAGE_SIZE

Proof step 348 from proof inv-truncate (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information