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

fs[ri[inodekey(m3)]] = inodenode(key, md1, true, m, m4, m5), dent = negdentry(str), dirs = abs-dirs(fs, ri), n ≠ 0, 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), ri[inodekey(m3)] ∈ fs, inodekey(m3) ∈ ri, ¬ dentrykey(m3, str) ∈ ri, ¬ inodekey(n) ∈ fo, ¬ inodekey(n) ∈ ri, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, m ≠ 0 ∨ m3 = ROOT_INO ⊦ ∃ err0. ⌊err0⌋ ∧ ⟨err := err0; asynced := ?⟩ ( (asynced → boolvar) ∧ mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size) = mkinode(m3, md0, true, m, m4, m5) ∧ ENOSPC = err), ∃ ino. ¬ ino ∈ dirs ∧ (¬ inodekey(ino) ∈ ri ∨ fs[ri[inodekey(ino)]].directory) ∧ ino ≠ 0 ∧ ⟨afs_mkdir_ino#(m3, md, ino; dent, err, dirs); files := abs-files(fs, ri); afs_inode_sync#(mkinode(m3, md0, true, m, m4, m5); dirs, files); p_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, files[m3].meta, false, files[m3].nlink, 0, files[m3].size) ); c_inode := getinode(dent.ino, dirs, files); asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size) = p_inode ∧ p_inode1 = c_inode ∧ negdentry(str) = dent ∧ ENOSPC = err), m = 0 ∧ m3 ≠ ROOT_INO

User applied rule exists right

And obtained the following new goals

Proof step 246:
fs[ri[inodekey(m3)]] = inodenode(key, md1, true, m, m4, m5), dent = negdentry(str), dirs = abs-dirs(fs, ri), 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(m3) ∈ ri, ri[inodekey(m3)] ∈ fs, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, m ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ⌊ENOSPC⌋ ∧ ⟨err := ENOSPC; asynced := ?⟩ ( (asynced → boolvar) ∧ mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size) = mkinode(m3, md0, true, m, m4, m5) ∧ ENOSPC = err), ∃ ino. ¬ ino ∈ dirs ∧ (¬ inodekey(ino) ∈ ri ∨ fs[ri[inodekey(ino)]].directory) ∧ ino ≠ 0 ∧ ⟨afs_mkdir_ino#(m3, md, ino; dent, err, dirs); files := abs-files(fs, ri); afs_inode_sync#(mkinode(m3, md0, true, m, m4, m5); dirs, files); p_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, files[m3].meta, false, files[m3].nlink, 0, files[m3].size) ); c_inode := getinode(dent.ino, dirs, files); asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size) = p_inode ∧ p_inode1 = c_inode ∧ negdentry(str) = dent ∧ ENOSPC = err), n = 0, dentrykey(m3, str) ∈ ri, inodekey(n) ∈ fo, inodekey(n) ∈ ri, m = 0 ∧ m3 ≠ ROOT_INO

Rule argument

pos: right 1 terms: ENOSPC abort: F discard: T computed: T

Additional information

Used terms: ENOSPC