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

dirs[entries0[str]] = mkdir(m, md, # links(entries0[str], dirs), m2, entries), dirs[ino1] = mkdir(m0, md0, # links(ino1, dirs), m3, entries0), dirs[ino] = mkdir(m1, md1, # links(ino, dirs), m5, entries1), dent = negdentry(str0), err = err0, inode = (ino ∈ dirs ⊃ mkinode(ino, md1, true, # links(ino, dirs), m5, m1);mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size)), p_inode = getinode(mkdentry(str, entries0[str]).ino, dirs, files), mkdentry(str, entries0[str]).dentry?, dom of < ino2, afs-cons(dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), ispath(q0, ROOT_INO, ino, dirs, files), of-cons(of, dirs, files), pw(user, md0), pw(user, md), px(user, md1), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, q0, ROOT_INO, dirs, files), ino ∈ dirs, ino1 ∈ dirs, entries0[str] ∈ dirs, str ∈ entries0, ⌊err0⌋ , links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO ⊦ ⟪if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then let dent0 = dent in {old_inode := (ino1 ∈ dirs ⊃ mkinode(ino1, md0, true, # links(ino1, dirs), m3, m0) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); old_dent := mkdentry(str, entries0[str]); old_dent_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_rename#(; old_inode, inode, old_dent_inode, p_inode, old_dent, dent, err, dirs, files; asynced); if dent0.dentry? then vfs_put_inode#(p_inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), entries0[str] = ROOT_INO, q + str ' ⊑ q0 + str0 '

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 819:
dirs[ino] = mkdir(m1, md1, # links(ino, dirs), m5, entries1), dirs[ino1] = mkdir(m0, md0, # links(ino1, dirs), m3, entries0), dirs[entries0[str]] = mkdir(m, md, # links(entries0[str], dirs), m2, entries), dent = negdentry(str0), err = err0, inode = (ino ∈ dirs ⊃ mkinode(ino, md1, true, # links(ino, dirs), m5, m1);mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size)), p_inode = getinode(mkdentry(str, entries0[str]).ino, dirs, files), mkdentry(str, entries0[str]).dentry?, dom of < ino2, afs-cons(dirs, files), ispath(q0, ROOT_INO, ino, dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pw(user, md), pw(user, md0), px(user, md0), px(user, md1), px-parent(user, q0, ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), str ∈ entries0, entries0[str] ∈ dirs, ino1 ∈ dirs, ino ∈ dirs, ⌊err0⌋ , links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟪skip; if err = ESUCCESS then let dent0 = dent in {old_inode := (ino1 ∈ dirs ⊃ mkinode(ino1, md0, true, # links(ino1, dirs), m3, m0) ;mkinode(ino1, files[ino1].meta, false, files[ino1].nlink, 0, files[ino1].size) ); old_dent := mkdentry(str, entries0[str]); old_dent_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); afs_rename#(; old_inode, inode, old_dent_inode, p_inode, old_dent, dent, err, dirs, files; asynced); if dent0.dentry? then vfs_put_inode#(p_inode, of, asynced; err, dirs, files)}⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), entries0[str] = ROOT_INO, q + str ' ⊑ q0 + str0 '

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)