[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 12 from proof inv-write-inode (previous step)

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, inode = mkinode(m, md, boolvar0, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), fs[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar0 ∨ fs[ri[inodekey(m)]].directory ∧ boolvar0 ∧ m2 = fs[ri[inodekey(m)]].size ⊦ ⟪if pre-write-inode(inode, fs, ri, ro) then choose key, nd, adr with true in {key := inodekey(inode.ino); nd := inodenode(key, inode.meta, inode.directory, inode.nlink, inode.nsubdirs, inode.size); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri)} else abort⟫ (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))

Heuristic conditional right split applied rule if positive right

And obtained the following new goals

Proof step 13:
fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, inode = mkinode(m, md, boolvar0, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), fs[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar0 ∨ fs[ri[inodekey(m)]].directory ∧ boolvar0 ∧ m2 = fs[ri[inodekey(m)]].size ⊦ ⟪choose key, nd, adr with true in {key := inodekey(inode.ino); nd := inodenode(key, inode.meta, inode.directory, inode.nlink, inode.nsubdirs, inode.size); aubifs_core_journal_add1#(nd, ri, fi, ro, fo; adr, fs, log; boolvar, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri)}⟫ (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

pos: right 1

Additional information

Used simplifier rules: ⊦ pre-write-inode(inode, fs, ri, ro) ↔ ( valid-file-inode(inode, fs, ri) ∨ valid-dir-inode(inode, fs, ri)) ∧ ( fs[ri[inodekey(inode.ino)]].nlink = 0 ∧ inode.ino ≠ ROOT_INO ↔ inodekey(inode.ino) ∈ ro); (s)%⊦ valid-file-inode(inode, fs, ri) ↔ valid-file-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ valid-file-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)%⊦ valid-dir-inode(inode, fs, ri) ↔ valid-dir-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs ∧ inode.size = fs[ri[inodekey(inode.ino)]].size; (s)%⊦ valid-dir-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)