v2.13.0
This release introduces a number of new features and improvements to the XSTS formalism:
- For loops (experimental)
- Statement optimization: the algorithm can significantly reduce the size of expressions passed to the solver by detecting unreachable branches of choice statements or failing assumptions
- The previous product domains were unified, and corresponding product domain variants were introduced for
PRED_SPLIT
andPRED_BOOL
- Dotfile visualization of counterexamples and the ARG
- Bugfixes