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

err0 = ESUCCESS, f = abs-files(files)[fh.fid], fh = ofh[fd], n = n0, ofh = abs-of(of), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fh.fid ∈ abs-files(files), fd ∈ of, fd ∈ ofh, psynced → asynced ⊦ ⟨skip; ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)⟩ (ofh = abs-of(of[fd, of[fd].pos:= n]) ∧ (psynced → asynced) ∧ n0 = n ∧ ESUCCESS = err0), whence = SEEK_END, whence = SEEK_CUR

Heuristic symbolic execution applied rule skip right

And obtained the following new goals

Proof step 107:
err0 = ESUCCESS, f = abs-files(files)[fh.fid], fh = ofh[fd], n = n0, ofh = abs-of(of), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ ofh, fd ∈ of, fh.fid ∈ abs-files(files), psynced → asynced ⊦ ⟨ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)⟩ (ofh = abs-of(of[fd, of[fd].pos:= n]) ∧ (psynced → asynced) ∧ n0 = n ∧ ESUCCESS = err0), whence = SEEK_CUR, whence = SEEK_END

Proof step 106 from proof refine-seek (previous step)

Heuristic symbolic execution applied rule skip right

And obtained the following new goals

Rule argument

Additional information