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

boolvar0 ↔ boolvar, fs0[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, adr = adr3, adr0 = adr2, adr4 = adr1, adr6 = adr5, err = ESUCCESS, fs = fs0[adr4, nd1][adr0, nd0][adr, nd], inode = mkinode(m, md, false, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, m2), log = ((log0 + adr4) + adr0) + adr, nd = fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0), nd0 = inodenode(inodekey(m), md, false, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, n), nd1 = truncnode(inodekey(m), m2), fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs0[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), new(adr1 ' + (adr2 ' + adr3), fs0), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, ro, fi, fo, log0), ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, m2 ≤ n ⊦ ⟪aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.data)}⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), m2 % VFS_PAGE_SIZE = 0, fs0[ri[inodekey(m)]].directory, buf-opt.some?, dups(adr1 ' + adr2 ' + adr3 ')

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 291:
fs0[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs = fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, n)] [adr3, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0) ], inode = mkinode(m, md, false, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, m2), nd = fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0), nd0 = inodenode(inodekey(m), md, false, fs0[ri[inodekey(m)]].nlink, fs0[ri[inodekey(m)]].nsubdirs, n), m2 % VFS_PAGE_SIZE ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, m ≠ 0, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs0[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), node-cons ((fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)).key, fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs0[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0)), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, ro, fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, m2 ≤ n, ¬ fs0[ri[inodekey(m)]].directory, ¬ buf-opt.some?, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0 ⊦ ⟪aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr3, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar0; ri); log := ((log0 + adr1 ') + adr2 ') + adr3 '; aubifs_core_index_store#(inodekey(m), adr2, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.data)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro))

Rule argument

Additional information

Used simplifier rules: ubifs-file-notdir: ⊦ datakey(ino, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ fs[ri[inodekey(ino)]].directory; (forward) from specification aubifs-inv% ⊦ adr ∈ adr0 ' ↔ adr = adr0; (s)% ⊦ adr ∈ adr0 ' + ax ↔ adr = adr0 ∨ adr ∈ ax; (s)% ⊦ dups(adr ' + adr0 ') ↔ adr = adr0; (s)% ⊦ dups(adr ' + ax) ↔ dups(ax) ∨ adr ∈ ax; (ws)% ⊦ new(adr ', fs) ↔ ¬ adr ∈ fs; (s)% ⊦ new(adr ' + log, fs) ↔ ¬ adr ∈ fs ∧ new(log, fs); (s)%a: ⊦ (ax + ax0) + ax1 = ax + ax0 + ax1; from specification list[address-list-set]% ⊦ ax + adr = ax + adr '; (s)% ⊦ inodekey(m).ino = m; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ node-cons(key0, truncnode(key1, n)) ↔ key0.inode?; (s)% ⊦ truncnode(key, m).key = key; (s)