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

fs[ri[inodekey(m)]].directory, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ¬ dentrykey(m, str) ∈ ri, asynced → boolvar, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ [aubifs_core_index_newino#(ri, fi, orphans(fs, ri), fo, fs, log, boolvar; key); nd1 := inodenode (inodekey(mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino), mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).meta, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).directory, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).nlink, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).nsubdirs, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).size + 1); nd0 := dentrynode (dentrykey(mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino, str), key.ino); nd := inodenode(key, md, false, 1, 0, 0); fs0 := fs; fs1 := fs; fs2 := fs; fs3 := fs; fs4 := fs; fs5 := fs; fs6 := fs; fs7 := fs; aubifs_core_journal_add3#(nd1, nd0, nd, ri, fi, orphans(fs, ri), fo; adr1, adr0, adr, fs, log; boolvar, err); ro0 := orphans(fs0, ri); p_inode := mkinode(m, md0, true, fs2[ri[inodekey(m)]].nlink, fs2[ri[inodekey(m)]].nsubdirs, fs2[ri[inodekey(m)]].size); m2 := fs3[ri[inodekey(m)]].size; m1 := fs4[ri[inodekey(m)]].nsubdirs; m0 := fs5[ri[inodekey(m)]].nlink; files := abs-files(fs6, ri); dirs := abs-dirs(fs7, ri); dent := negdentry(str); c_inode := p_inode1; if err = ESUCCESS then {ri0 := ri; aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, orphans(fs1, ri), fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(p_inode.ino, dent.name), adr0, fi, orphans(fs1, ri0), fo, fs, log, boolvar; ri); aubifs_core_index_store#(key, adr, fi, orphans(fs1, ri0), fo, fs, log, boolvar; ri); dent := mkdentry(dent.name, key.ino); p_inode := mkinode(p_inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode := mkinode(key.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨old_dent := negdentry(str); p_inode0 := mkinode(m, md0, true, m0, m1, m2); afs_create#(md; p_inode0, p_inode1, old_dent, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ dent = old_dent ∧ err = err0)), fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 27:
ro = orphans(fs, ri), fs[ri[inodekey(m)]].directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, asynced → boolvar, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO ⊦ [choose n with ¬ inodekey(n) ∈ ri ∧ ¬ inodekey(n) ∈ fo ∧ n ≠ 0 in key := inodekey(n); nd1 := inodenode (inodekey(mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino), mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).meta, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).directory, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).nlink, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).nsubdirs, mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).size + 1); nd0 := dentrynode (dentrykey(mkinode(m, md0, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino, str), key.ino); nd := inodenode(key, md, false, 1, 0, 0); fs0 := fs; fs1 := fs; fs2 := fs; fs3 := fs; fs4 := fs; fs5 := fs; fs6 := fs; fs7 := fs; aubifs_core_journal_add3#(nd1, nd0, nd, ri, fi, orphans(fs, ri), fo; adr1, adr0, adr, fs, log; boolvar, err); ro0 := orphans(fs0, ri); p_inode := mkinode(m, md0, true, fs2[ri[inodekey(m)]].nlink, fs2[ri[inodekey(m)]].nsubdirs, fs2[ri[inodekey(m)]].size); m2 := fs3[ri[inodekey(m)]].size; m1 := fs4[ri[inodekey(m)]].nsubdirs; m0 := fs5[ri[inodekey(m)]].nlink; files := abs-files(fs6, ri); dirs := abs-dirs(fs7, ri); dent := negdentry(str); c_inode := p_inode1; if err = ESUCCESS then {ri0 := ri; aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, orphans(fs1, ri), fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(p_inode.ino, dent.name), adr0, fi, orphans(fs1, ri0), fo, fs, log, boolvar; ri); aubifs_core_index_store#(key, adr, fi, orphans(fs1, ri0), fo, fs, log, boolvar; ri); dent := mkdentry(dent.name, key.ino); p_inode := mkinode(p_inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode := mkinode(key.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨old_dent := negdentry(str); p_inode0 := mkinode(m, md0, true, m0, m1, m2); afs_create#(md; p_inode0, p_inode1, old_dent, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ dent = old_dent ∧ err = err0)), dentrykey(m, str) ∈ ri, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_newino#(RI, FI, RO, FO, FS, LOG, CSYNCED; KEY) {choose n with ¬ inodekey(n) ∈ RI ∧ ¬ inodekey(n) ∈ FO ∧ n ≠ 0 in KEY := inodekey(n) };