Hi Sanghu,
Your problem is very popular in fuzzing: running the same program with
millions of (mutated) inputs.
Perhaps you may want to look at how a fuzzer solves that problem, and
do something similar:
https://lcamtuf.blogspot.com/2015/06/new-in-afl-persistent-mode.html
Best,
Sang
On Sun, Jun
Hello,
I'm trying to understand the test cases generated when the input is
symbolic file.
For the password example under this link:
https://klee.github.io/tutorials/using-symbolic/, a test case viewed
by ktest-tool is the following:
https://klee.github.io/tutorials/using-symbolic/
ktest file :
