[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 176 from proof write-term (previous step)

files0[m] = mkfile(m2, md0, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), dirs0 = dirs, err = ESUCCESS, files = files1[ino, files1[ino].size:= inode.size][ino, files1[ino, files1[ino].size:= inode.size][ino].meta:= inode.meta], files1 = files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)], ino = inode.ino, ino3 = 0, inode = mkinode(m, md0, false, # links(m, dirs), 0, m2), inode0 = (inode1.ino ∈ dirs ⊃ mkinode(inode1.ino, dirs[inode1.ino].meta, true, dirs[inode1.ino].nlink, dirs[inode1.ino].nsubdirs, dirs[inode1.ino].size) ;mkinode(inode1.ino, files[inode1.ino].meta, false, files[inode1.ino].nlink, 0, files[inode1.ino].size) ), inode1 = mkinode(m, md0, false, # links(m, dirs), 0, m2), afs-cons(dirs, files), afs-cons(dirs, files0), of-cons(of, dirs, files0), fd ∈ of, m ∈ files0, ino ∈ files1, n0 ≤ # buf0 ⊦ ⟪vfs_write_loop#(m0, inode0, m0 + n0, buf0, dirs; ino3, err, files, asynced); if ino3 ≠ 0 then err := ESUCCESS; if err = ESUCCESS then let ino = inode0.size in {n0 := ino3, ino1 := m0 + ino3; if ino3 ≠ 0 ∧ ino < ino1 then {inode0.size := ino1; afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_write_inode#(inode0; err, dirs, files; asynced)}; if err ≠ ESUCCESS then n0 := (m0 ≤ ino ⊃ ino - m0;0), err := ESUCCESS; of[fd].pos := m0 + n0}⟫ (dirs0 = dirs), n0 = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 177:
files0[m] = mkfile(m2, md0, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), err = ESUCCESS, files = files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)], ino3 = 0, n0 ≠ 0, afs-cons(dirs, files0[m, mkfile(m2, md0, # links(m, dirs), content0 upto m2)]), afs-cons(dirs, files0), of-cons(of, dirs, files0), fd ∈ of, m ∈ files0, n0 ≤ # buf0 ⊦ ⟪vfs_write_loop#(m0, mkinode(m, md0, false, # links(m, dirs), 0, m2), m0 + n0, buf0, dirs; ino3, err, files, asynced); if ino3 ≠ 0 then err := ESUCCESS; dirs0 := dirs; if err = ESUCCESS then let ino = m2 in {n0 := ino3, ino1 := m0 + ino3; if ino3 ≠ 0 ∧ ino < ino1 then {inode0 := mkinode(m, md0, false, # links(m, dirs), 0, ino1); afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_write_inode#(inode0; err, dirs, files; asynced)}; if err ≠ ESUCCESS then n0 := (m0 ≤ ino ⊃ ino - m0;0), err := ESUCCESS; of[fd].pos := m0 + n0}⟫ (dirs0 = dirs), mode ≠ MODE_W ∧ mode ≠ MODE_RW, m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content0

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).size:= m6 = mkinode(m, md, boolvar, m0, m1, m6); (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)%⊦ of-cons(of, dirs, files) ∧ fd ∈ of ∧ of[fd] = mkfile(ino, mode, n) ∧ afs-cons(dirs, files) → ¬ ino ∈ dirs; (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkfile(m, md, m0, content).size:= m1 = mkfile(m1, md, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)