Repository navigation
-
Counterexample reduction prepares large and recursive inputs more efficiently, reducing repeated work and memory use.
-
Fixed overflow and invalid values during numeric redistribution, and prevented reordering between incompatible fields.
-
Reduction limited by deadline completes final numeric reordering and includes interrupted passes in its statistics.
-
Accepted probe counts now reflect the reducer's acceptance checks, and reduction passes consistently respect the selected strategies.