About the Execution of ITS-Tools for CSRepetitions-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFF?FFFFFFT?FF?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029000731.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CSRepetitions-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029000731
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 18K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748647014271
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-05-30 23:16:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 23:16:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:16:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-30 23:16:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-30 23:16:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 491 ms
[2025-05-30 23:16:56] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1311 PT places and 2300.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-05-30 23:16:56] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2025-05-30 23:16:56] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-COL-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 40095 steps (243 resets) in 240 ms. (166 steps per ms) remains 1/22 properties
BEST_FIRST walk for 76 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
[2025-05-30 23:16:57] [INFO ] Flatten gal took : 16 ms
[2025-05-30 23:16:57] [INFO ] Flatten gal took : 1 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 10
[2025-05-30 23:16:57] [INFO ] Unfolded HLPN to a Petri net with 402 places and 500 transitions 1500 arcs in 20 ms.
[2025-05-30 23:16:57] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 302 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2025-05-30 23:16:57] [INFO ] Computed 101 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:57] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-05-30 23:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:16:58] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:16:58] [INFO ] Invariant cache hit.
[2025-05-30 23:16:58] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60551ms
Finished structural reductions in LTL mode , in 1 iterations and 61117 ms. Remains : 402/402 places, 500/500 transitions.
Support contains 302 out of 402 places after structural reductions.
[2025-05-30 23:17:58] [INFO ] Flatten gal took : 41 ms
[2025-05-30 23:17:58] [INFO ] Flatten gal took : 31 ms
[2025-05-30 23:17:58] [INFO ] Input system was already deterministic with 500 transitions.
RANDOM walk for 37168 steps (251 resets) in 1437 ms. (25 steps per ms) remains 0/21 properties
FORMULA CSRepetitions-COL-10-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 100 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 39 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:59] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-30 23:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:18:00] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:18:00] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:18:00] [INFO ] Redundant transitions in 35 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:18:00] [INFO ] Invariant cache hit.
[2025-05-30 23:18:00] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60930 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-01
Stuttering criterion allowed to conclude after 752 steps with 11 reset in 25 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-01 finished in 61156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 26 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:19:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:19:01] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 23:19:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:19:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:19:01] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:19:01] [INFO ] Redundant transitions in 10 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:19:01] [INFO ] Invariant cache hit.
[2025-05-30 23:19:01] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60743 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 658 reset in 1273 ms.
Product exploration explored 100000 steps with 661 reset in 1311 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 552 steps (0 resets) in 11 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-30 23:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:20:14] [INFO ] [Real]Absence check using 101 positive place invariants in 584 ms returned sat
[2025-05-30 23:20:19] [INFO ] [Real]Absence check using state equation in 4983 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:20:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 23:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:20:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:20:20] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:20:20] [INFO ] Redundant transitions in 33 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:20:20] [INFO ] Invariant cache hit.
[2025-05-30 23:20:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60754 ms. Remains : 402/402 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 558 steps (0 resets) in 14 ms. (37 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-05-30 23:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:21:31] [INFO ] [Real]Absence check using 101 positive place invariants in 553 ms returned sat
[2025-05-30 23:21:36] [INFO ] [Real]Absence check using state equation in 5005 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 655 reset in 1171 ms.
Product exploration explored 100000 steps with 656 reset in 1233 ms.
Built C files in :
/tmp/ltsmin10094018977073358675
[2025-05-30 23:21:38] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2025-05-30 23:21:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:21:38] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2025-05-30 23:21:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:21:38] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2025-05-30 23:21:38] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:21:38] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10094018977073358675
Running compilation step : cd /tmp/ltsmin10094018977073358675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1221 ms.
Running link step : cd /tmp/ltsmin10094018977073358675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10094018977073358675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13613439398946951460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 201 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 31 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:21:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 23:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:21:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:21:54] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:21:54] [INFO ] Redundant transitions in 2 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:21:54] [INFO ] Invariant cache hit.
[2025-05-30 23:21:54] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60699 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin3438199471601890180
[2025-05-30 23:22:54] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2025-05-30 23:22:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:22:54] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2025-05-30 23:22:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:22:54] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2025-05-30 23:22:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:22:54] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3438199471601890180
Running compilation step : cd /tmp/ltsmin3438199471601890180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1141 ms.
Running link step : cd /tmp/ltsmin3438199471601890180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3438199471601890180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11543123714607043268.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 23:23:09] [INFO ] Flatten gal took : 23 ms
[2025-05-30 23:23:09] [INFO ] Flatten gal took : 23 ms
[2025-05-30 23:23:09] [INFO ] Time to serialize gal into /tmp/LTL18402886387559276100.gal : 6 ms
[2025-05-30 23:23:09] [INFO ] Time to serialize properties into /tmp/LTL3657623601561854854.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18402886387559276100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4666821184464318813.hoa' '-atoms' '/tmp/LTL3657623601561854854.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3657623601561854854.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4666821184464318813.hoa
Detected timeout of ITS tools.
[2025-05-30 23:23:25] [INFO ] Flatten gal took : 19 ms
[2025-05-30 23:23:25] [INFO ] Flatten gal took : 18 ms
[2025-05-30 23:23:25] [INFO ] Time to serialize gal into /tmp/LTL4582549265319582432.gal : 3 ms
[2025-05-30 23:23:25] [INFO ] Time to serialize properties into /tmp/LTL2748599408692722911.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4582549265319582432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2748599408692722911.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Client_Waiting_5)+(Client_...4042
Formula 0 simplified : G(F!"((((((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Client_Sending_5)+(Client_Se...4035
Detected timeout of ITS tools.
[2025-05-30 23:23:40] [INFO ] Flatten gal took : 19 ms
[2025-05-30 23:23:40] [INFO ] Applying decomposition
[2025-05-30 23:23:40] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12529052991063609271.txt' '-o' '/tmp/graph12529052991063609271.bin' '-w' '/tmp/graph12529052991063609271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12529052991063609271.bin' '-l' '-1' '-v' '-w' '/tmp/graph12529052991063609271.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:23:40] [INFO ] Decomposing Gal with order
[2025-05-30 23:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:23:40] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-30 23:23:40] [INFO ] Flatten gal took : 271 ms
[2025-05-30 23:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 17 ms.
[2025-05-30 23:23:40] [INFO ] Time to serialize gal into /tmp/LTL2529258729930091535.gal : 5 ms
[2025-05-30 23:23:40] [INFO ] Time to serialize properties into /tmp/LTL9367502879336131659.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2529258729930091535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9367502879336131659.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((gu2.Client_Waiting_0+gu2.Client_Waiting_1)+(gu2.Client_Waiting_2+gu2.Client_Waiting_3))+((gu2.Client_Waiting_4+gu2.Cl...4846
Formula 0 simplified : G(F!"((((((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Clie...4839
Detected timeout of ITS tools.
Treatment of property CSRepetitions-COL-10-LTLCardinality-03 finished in 294849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(G(p1) U X(p2))))&&(p0 U p3)))'
Support contains 302 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 2 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:23:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:23:55] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-30 23:23:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:23:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:23:55] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:23:55] [INFO ] Invariant cache hit.
[2025-05-30 23:23:55] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-04
Product exploration explored 100000 steps with 624 reset in 1687 ms.
Product exploration explored 100000 steps with 621 reset in 1714 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p3) p0))), (X (AND p0 p1)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 101 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p1)]
RANDOM walk for 28487 steps (195 resets) in 495 ms. (57 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X p3), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p3) p0))), (X (AND p0 p1)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 16 factoid took 193 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-10-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-10-LTLCardinality-04 finished in 65247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 200 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:25:01] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 23:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:25:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:25:01] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:25:01] [INFO ] Invariant cache hit.
[2025-05-30 23:25:01] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 5 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-05 finished in 60966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 101 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Applied a total of 300 rules in 35 ms. Remains 202 /402 variables (removed 200) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 202 cols
[2025-05-30 23:26:01] [INFO ] Computed 1 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:26:01] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 23:26:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:26:02] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:26:02] [INFO ] Redundant transitions in 14 ms returned []
Running 300 sub problems to find dead transitions.
[2025-05-30 23:26:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 203 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20931 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 300/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 1)
(t21 1)
(t22 1)
(t23 1)
(t24 1)
(t25 1)
(t26 1)
(t27 1)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 2)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 1)
(t56 1)
(t57 2)
(t58 1)
(t59 2)
(t60 1)
(t61 1)
(t62 1)
(t63 2)
(t64 1)
(t65 2)
(t66 1)
(t67 1)
(t68 1)
(t69 1)
(t70 2)
(t71 2)
(t72 1)
(t73 1)
(t74 2)
(t75 1)
(t76 2)
(t77 2)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 1)
(t88 1)
(t89 1)
(t90 1)
(t91 1)
(t92 1)
(t93 1)
(t94 1)
(t95 1)
(t96 1)
(t97 1)
(t98 1)
(t99 10)
(t100 1)
(t101 1)
(t102 1)
(t103 1)
(t104 1)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 1)
(t111 1)
(t112 1)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 1)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 1)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 1)
(t130 1)
(t131 1)
(t132 1)
(t133 1)
(t134 1)
(t135 1)
(t136 1)
(t137 1)
(t138 1)
(t139 1)
(t140 1)
(t141 1)
(t142 1)
(t143 1)
(t144 1)
(t145 1)
(t146 1)
(t147 1)
(t148 1)
(t149 1)
(t150 1)
(t151 1)
(t152 1)
(t153 1)
(t154 1)
(t155 1)
(t156 1)
(t157 1)
(t158 1)
(t159 1)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 1)
(t171 1)
(t172 1)
(t173 1)
(t174 1)
(t175 1)
(t176 1)
(t177 1)
(t178 1)
(t179 1)
(t180 1)
(t181 1)
(t182 1)
(t183 1)
(t184 1)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 1)
(t190 1)
(t191 1)
(t192 1)
(t193 1)
(t194 1)
(t195 1)
(t196 1)
(t197 1)
(t198 1)
(t199 10)
(t200 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 503 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51062ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 51063ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/402 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51296 ms. Remains : 202/402 places, 400/500 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-06
Product exploration explored 100000 steps with 2536 reset in 551 ms.
Stack based approach found an accepted trace after 14908 steps with 374 reset with depth 38 and stack size 38 in 86 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-06 finished in 52010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&F(p2))))'
Support contains 301 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2025-05-30 23:26:53] [INFO ] Computed 101 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:26:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-30 23:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:26:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:26:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:26:54] [INFO ] Redundant transitions in 9 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:26:54] [INFO ] Invariant cache hit.
[2025-05-30 23:26:54] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60574 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-07
Stuttering criterion allowed to conclude after 21227 steps with 491 reset in 203 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-07 finished in 60994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 101 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 202 transition count 400
Applied a total of 300 rules in 18 ms. Remains 202 /402 variables (removed 200) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 202 cols
[2025-05-30 23:27:54] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:27:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-30 23:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:27:55] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:27:55] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2025-05-30 23:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 203 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 300/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 503 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50472ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 50474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 202/402 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50761 ms. Remains : 202/402 places, 400/500 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-09
Product exploration explored 100000 steps with 1966 reset in 468 ms.
Product exploration explored 100000 steps with 1962 reset in 488 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p0)]
[2025-05-30 23:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:28:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-30 23:28:47] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-30 23:28:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:28:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-30 23:28:47] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-05-30 23:28:47] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 14 ms.
[2025-05-30 23:28:47] [INFO ] Added : 1 causal constraints over 1 iterations in 54 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 101 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 202 /202 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2025-05-30 23:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:28:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-30 23:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:28:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:28:47] [INFO ] Redundant transitions in 6 ms returned []
Running 300 sub problems to find dead transitions.
[2025-05-30 23:28:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/602 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 203 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 400/601 variables, 201/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 1/602 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 300/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 503 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51051ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 51052ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51257 ms. Remains : 202/202 places, 400/400 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
[2025-05-30 23:29:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:29:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-30 23:29:39] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-05-30 23:29:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:29:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-30 23:29:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-30 23:29:40] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 15 ms.
[2025-05-30 23:29:40] [INFO ] Added : 1 causal constraints over 1 iterations in 56 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1997 reset in 447 ms.
Stack based approach found an accepted trace after 56495 steps with 1105 reset with depth 6 and stack size 6 in 260 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-09 finished in 105956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(p0))))&&F(p1))))'
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 402 cols
[2025-05-30 23:29:40] [INFO ] Computed 101 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:29:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 23:29:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:29:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:29:41] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:29:41] [INFO ] Invariant cache hit.
[2025-05-30 23:29:41] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-11
Product exploration explored 100000 steps with 10777 reset in 765 ms.
Product exploration explored 100000 steps with 10700 reset in 707 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 93 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2025-05-30 23:30:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:30:45] [INFO ] [Real]Absence check using 101 positive place invariants in 88 ms returned sat
[2025-05-30 23:30:47] [INFO ] [Real]Absence check using state equation in 2813 ms returned sat
[2025-05-30 23:30:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:30:48] [INFO ] [Nat]Absence check using 101 positive place invariants in 106 ms returned sat
[2025-05-30 23:31:01] [INFO ] [Nat]Absence check using state equation in 13290 ms returned sat
[2025-05-30 23:31:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:31:02] [INFO ] [Nat]Added 100 Read/Feed constraints in 117 ms returned sat
[2025-05-30 23:31:02] [INFO ] Computed and/alt/rep : 400/500/400 causal constraints (skipped 0 transitions) in 22 ms.
[2025-05-30 23:31:02] [INFO ] Added : 4 causal constraints over 1 iterations in 413 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 33 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:31:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:02] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-30 23:31:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:31:02] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:31:02] [INFO ] Invariant cache hit.
[2025-05-30 23:31:02] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in LTL mode , in 1 iterations and 60862 ms. Remains : 402/402 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 96 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2025-05-30 23:32:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:32:05] [INFO ] [Real]Absence check using 101 positive place invariants in 88 ms returned sat
[2025-05-30 23:32:07] [INFO ] [Real]Absence check using state equation in 2787 ms returned sat
[2025-05-30 23:32:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:32:08] [INFO ] [Nat]Absence check using 101 positive place invariants in 113 ms returned sat
[2025-05-30 23:32:21] [INFO ] [Nat]Absence check using state equation in 13190 ms returned sat
[2025-05-30 23:32:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:32:22] [INFO ] [Nat]Added 100 Read/Feed constraints in 120 ms returned sat
[2025-05-30 23:32:22] [INFO ] Computed and/alt/rep : 400/500/400 causal constraints (skipped 0 transitions) in 21 ms.
[2025-05-30 23:32:22] [INFO ] Added : 4 causal constraints over 1 iterations in 411 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 10736 reset in 667 ms.
Product exploration explored 100000 steps with 10741 reset in 661 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 51 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:32:27] [INFO ] Redundant transitions in 39 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:32:27] [INFO ] Invariant cache hit.
[2025-05-30 23:32:27] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)timeout
(s346 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60449 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin17217528388378797925
[2025-05-30 23:33:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17217528388378797925
Running compilation step : cd /tmp/ltsmin17217528388378797925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin17217528388378797925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17217528388378797925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8519987791342765533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 102 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 27 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:33:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:33:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-30 23:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:33:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:33:43] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:33:43] [INFO ] Invariant cache hit.
[2025-05-30 23:33:43] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin2824366824737194012
[2025-05-30 23:34:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2824366824737194012
Running compilation step : cd /tmp/ltsmin2824366824737194012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 745 ms.
Running link step : cd /tmp/ltsmin2824366824737194012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2824366824737194012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10841003066710041335.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 23:34:58] [INFO ] Flatten gal took : 41 ms
[2025-05-30 23:34:58] [INFO ] Flatten gal took : 32 ms
[2025-05-30 23:34:58] [INFO ] Time to serialize gal into /tmp/LTL41387711853429659.gal : 9 ms
[2025-05-30 23:34:58] [INFO ] Time to serialize properties into /tmp/LTL11589167045801680351.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL41387711853429659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5111180394381202433.hoa' '-atoms' '/tmp/LTL11589167045801680351.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL11589167045801680351.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5111180394381202433.hoa
Detected timeout of ITS tools.
[2025-05-30 23:35:14] [INFO ] Flatten gal took : 17 ms
[2025-05-30 23:35:14] [INFO ] Flatten gal took : 16 ms
[2025-05-30 23:35:14] [INFO ] Time to serialize gal into /tmp/LTL11922639647745439817.gal : 3 ms
[2025-05-30 23:35:14] [INFO ] Time to serialize properties into /tmp/LTL13611947529767555678.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11922639647745439817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13611947529767555678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X(X(X("(RequestBufferSlots>=1)")))))&&(F("((((((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Cl...2081
Formula 0 simplified : X(XXXX!"(RequestBufferSlots>=1)" | G!"((((((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sendi...2067
Detected timeout of ITS tools.
[2025-05-30 23:35:29] [INFO ] Flatten gal took : 17 ms
[2025-05-30 23:35:29] [INFO ] Applying decomposition
[2025-05-30 23:35:29] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9577613718997523630.txt' '-o' '/tmp/graph9577613718997523630.bin' '-w' '/tmp/graph9577613718997523630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9577613718997523630.bin' '-l' '-1' '-v' '-w' '/tmp/graph9577613718997523630.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:35:29] [INFO ] Decomposing Gal with order
[2025-05-30 23:35:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:35:29] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-30 23:35:29] [INFO ] Flatten gal took : 103 ms
[2025-05-30 23:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 16 ms.
[2025-05-30 23:35:29] [INFO ] Time to serialize gal into /tmp/LTL863421524299581166.gal : 6 ms
[2025-05-30 23:35:29] [INFO ] Time to serialize properties into /tmp/LTL14768580402961797543.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL863421524299581166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14768580402961797543.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(X(X("(gi0.gu0.RequestBufferSlots>=1)")))))&&(F("((((((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1...2493
Formula 0 simplified : X(XXXX!"(gi0.gu0.RequestBufferSlots>=1)" | G!"((((((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Se...2479
Detected timeout of ITS tools.
Treatment of property CSRepetitions-COL-10-LTLCardinality-11 finished in 363661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(!p1)) U p2))'
Support contains 301 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:35:44] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-30 23:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:35:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:35:44] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:35:44] [INFO ] Redundant transitions in 9 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:35:44] [INFO ] Invariant cache hit.
[2025-05-30 23:35:44] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60661 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), p1]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-13
Stuttering criterion allowed to conclude after 267 steps with 2 reset in 3 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-10-LTLCardinality-13 finished in 60768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F((G(F(p1))||(F(p1)&&X(p2))))))'
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 5 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:36:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:36:45] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 23:36:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:36:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:36:45] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:36:45] [INFO ] Invariant cache hit.
[2025-05-30 23:36:45] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-14
Product exploration explored 100000 steps with 2766 reset in 836 ms.
Product exploration explored 100000 steps with 2757 reset in 875 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 875 steps (3 resets) in 24 ms. (35 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:37:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 23:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:37:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:37:49] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:37:49] [INFO ] Invariant cache hit.
[2025-05-30 23:37:49] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 402/402 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 964 steps (5 resets) in 16 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2684 reset in 835 ms.
Product exploration explored 100000 steps with 2862 reset in 886 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:38:53] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:38:53] [INFO ] Invariant cache hit.
[2025-05-30 23:38:53] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60337 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin11952074725774830301
[2025-05-30 23:39:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11952074725774830301
Running compilation step : cd /tmp/ltsmin11952074725774830301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 749 ms.
Running link step : cd /tmp/ltsmin11952074725774830301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11952074725774830301;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15344264814260386551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:40:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:40:08] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 23:40:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:40:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:40:09] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:40:09] [INFO ] Invariant cache hit.
[2025-05-30 23:40:09] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin12133254847135784948
[2025-05-30 23:41:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12133254847135784948
Running compilation step : cd /tmp/ltsmin12133254847135784948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 751 ms.
Running link step : cd /tmp/ltsmin12133254847135784948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12133254847135784948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2734616069744035499.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 23:41:24] [INFO ] Flatten gal took : 18 ms
[2025-05-30 23:41:24] [INFO ] Flatten gal took : 12 ms
[2025-05-30 23:41:24] [INFO ] Time to serialize gal into /tmp/LTL15953478167443546572.gal : 2 ms
[2025-05-30 23:41:24] [INFO ] Time to serialize properties into /tmp/LTL10610985576390528181.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15953478167443546572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6408347949416757242.hoa' '-atoms' '/tmp/LTL10610985576390528181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10610985576390528181.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6408347949416757242.hoa
Detected timeout of ITS tools.
[2025-05-30 23:41:39] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:41:39] [INFO ] Flatten gal took : 14 ms
[2025-05-30 23:41:39] [INFO ] Time to serialize gal into /tmp/LTL10172145685022791902.gal : 2 ms
[2025-05-30 23:41:39] [INFO ] Time to serialize properties into /tmp/LTL3067472620334382826.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10172145685022791902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3067472620334382826.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("(Server_Waiting<=(((((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Client...6288
Formula 0 simplified : XXXG!"(Server_Waiting<=(((((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Client_Wait...6266
Detected timeout of ITS tools.
[2025-05-30 23:41:54] [INFO ] Flatten gal took : 14 ms
[2025-05-30 23:41:54] [INFO ] Applying decomposition
[2025-05-30 23:41:54] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3871527048180878258.txt' '-o' '/tmp/graph3871527048180878258.bin' '-w' '/tmp/graph3871527048180878258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3871527048180878258.bin' '-l' '-1' '-v' '-w' '/tmp/graph3871527048180878258.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:41:54] [INFO ] Decomposing Gal with order
[2025-05-30 23:41:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:41:54] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-30 23:41:54] [INFO ] Flatten gal took : 82 ms
[2025-05-30 23:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 23:41:55] [INFO ] Time to serialize gal into /tmp/LTL16242009738126992082.gal : 4 ms
[2025-05-30 23:41:55] [INFO ] Time to serialize properties into /tmp/LTL10479186209569171080.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16242009738126992082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10479186209569171080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("(gu1.Server_Waiting<=(((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+(gu1.Client_Waiting_2+gu1.Client_Waiting_3))+((gu1...7496
Formula 0 simplified : XXXG!"(gu1.Server_Waiting<=(((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+(gu1.Client_Waiting_2+gu1.Client_Waiting_3))+((gu1.Clie...7474
Detected timeout of ITS tools.
Treatment of property CSRepetitions-COL-10-LTLCardinality-14 finished in 324772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0&&(X(X(X(p1)))||F(p2))))))'
Support contains 302 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-30 23:42:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:42:10] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:42:10] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:42:10] [INFO ] Invariant cache hit.
[2025-05-30 23:42:10] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60565 ms. Remains : 402/402 places, 500/500 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 619 reset in 1249 ms.
Product exploration explored 100000 steps with 624 reset in 1252 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 9 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), false, false, false, false]
RANDOM walk for 40002 steps (272 resets) in 597 ms. (66 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
[2025-05-30 23:43:14] [INFO ] Invariant cache hit.
[2025-05-30 23:43:14] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 302/902 variables, and 101 constraints, problems are : Problem set: 2 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 0/402 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (G (OR p1 p2 p0)), (G (OR (NOT p1) p2 p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 11 factoid took 403 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
[2025-05-30 23:43:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:43:23] [INFO ] [Real]Absence check using 101 positive place invariants in 3440 ms returned unknown
Could not prove EG p0
Support contains 101 out of 402 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-30 23:43:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:43:23] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:43:23] [INFO ] Redundant transitions in 4 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:43:23] [INFO ] Invariant cache hit.
[2025-05-30 23:43:23] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60598 ms. Remains : 402/402 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[p0]
RANDOM walk for 521 steps (0 resets) in 10 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
[2025-05-30 23:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 23:44:32] [INFO ] [Real]Absence check using 101 positive place invariants in 3437 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 30 ms :[p0]
Product exploration explored 100000 steps with 622 reset in 1012 ms.
Product exploration explored 100000 steps with 627 reset in 1066 ms.
Built C files in :
/tmp/ltsmin651233417034835164
[2025-05-30 23:44:34] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2025-05-30 23:44:34] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:44:34] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2025-05-30 23:44:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:44:34] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2025-05-30 23:44:34] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:44:34] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin651233417034835164
Running compilation step : cd /tmp/ltsmin651233417034835164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1122 ms.
Running link step : cd /tmp/ltsmin651233417034835164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin651233417034835164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11578271137035925199.hoa' '--buchi-type=spotba'
LTSmin run took 3680 ms.
FORMULA CSRepetitions-COL-10-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-10-LTLCardinality-15 finished in 149086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(X(p0))))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F((G(F(p1))||(F(p1)&&X(p2))))))'
Found a Shortening insensitive property : CSRepetitions-COL-10-LTLCardinality-14
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:44:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:44:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 23:44:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:44:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:44:40] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:44:40] [INFO ] Invariant cache hit.
[2025-05-30 23:44:40] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 60765 ms. Remains : 402/402 places, 500/500 transitions.
Running random walk in product with property : CSRepetitions-COL-10-LTLCardinality-14
Product exploration explored 100000 steps with 2730 reset in 853 ms.
Product exploration explored 100000 steps with 2723 reset in 903 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 772 steps (3 resets) in 16 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:45:43] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-30 23:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:45:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:45:43] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:45:43] [INFO ] Invariant cache hit.
[2025-05-30 23:45:43] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 2)
(t1 1)
(t2 1)
(t3 2)
(t4 1)
(t5 1)
(t6 1)
(t7 2)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 2)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 1)
(t21 1)
(t22 3)
(t23 1)
(t24 2)
(t25 2)
(t26 3)
(t27 1)
(t28 1)
(t29 2)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 1)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 1)
(t63 1)
(t64 1)
(t65 1)
(t66 1)
(t67 1)
(t68 1)
(t69 1)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 1)
(t88 1)
(t89 1)
(t90 1)
(t91 2)
(t92 2)
(t93 1)
(t94 1)
(t95 1)
(t96 1)
(t97 1)
(t98 1)
(t99 1)
(t100 1)
(t101 1)
(t102 1)
(t103 1)
(t104 1)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 1)
(t111 1)
(t112 1)
(t113 2)
(t114 1)
(t115 1)
(t116 1)
(t117 1)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 2)
(t123 1)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 1)
(t130 1)
(t131 1)
(t132 1)
(t133 1)
(t134 1)
(t135 1)
(t136 1)
(t137 1)
(t138 1)
(t139 1)
(t140 1)
(t141 1)
(t142 1)
(t143 1)
(t144 1)
(t145 1)
(t146 1)
(t147 1)
(t148 1)
(t149 1)
(t150 1)
(t151 1)
(t152 1)
(t153 1)
(t154 1)
(t155 1)
(t156 1)
(t157 1)
(t158 1)
(t159 1)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 1)
(t171 1)
(t172 1)
(t173 1)
(t174 1)
(t175 1)
(t176 1)
(t177 1)
(t178 1)
(t179 1)
(t180 1)
(t181 1)
(t182 1)
(t183 1)
(t184 1)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 1)
(t190 1)
(t191 1)
(t192 2)
(t193 1)
(t194 1)
(t195 1)
(t196 1)
(t197 1)
(t198 1)
(t199 1)
(t200 2)
(t201 1)
(t202 1)
(t203 1)
(t204 1)
(t205 1)
(t206 2)
(t207 2)
(t208 2)
(t209 1)
(t210 1)
(t211 2)
(t212 2)
(t213 2)
(t214 1)
(t215 1)
(t216 1)
(t217 1)
(t218 2)
(t219 2)
(t220 1)
(t221 1)
(t222 2)
(t223 1)
(t224 1)
(t225 2)
(t226 1)
(t227 1)
(t228 1)
(t229 1)
(t230 2)
(t231 2)
(t232 1)
(t233 1)
(t234 1)
(t235 1)
(t236 2)
(t237 1)
(t238 2)
(t239 2)
(t240 1)
(t241 2)
(t242 1)
(t243 1)
(t244 2)
(t245 1)
(t246 2)
(t247 2)
(t248 1)
(t249 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 402/402 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 1214 steps (6 resets) in 27 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 239 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2836 reset in 885 ms.
Product exploration explored 100000 steps with 2731 reset in 912 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:46:47] [INFO ] Redundant transitions in 3 ms returned []
Running 400 sub problems to find dead transitions.
[2025-05-30 23:46:47] [INFO ] Invariant cache hit.
[2025-05-30 23:46:47] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60324 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin3073233850210535634
[2025-05-30 23:47:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3073233850210535634
Running compilation step : cd /tmp/ltsmin3073233850210535634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin3073233850210535634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3073233850210535634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9971971929948426441.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 202 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 402 /402 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 23:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:48:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 23:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:48:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 23:48:03] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 23:48:03] [INFO ] Invariant cache hit.
[2025-05-30 23:48:03] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 603 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 100/402 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 500/902 variables, 402/503 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 100/603 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 400/1003 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1003 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 402/402 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in LTL mode , in 1 iterations and 60710 ms. Remains : 402/402 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin2106956909362746910
[2025-05-30 23:49:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2106956909362746910
Running compilation step : cd /tmp/ltsmin2106956909362746910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 723 ms.
Running link step : cd /tmp/ltsmin2106956909362746910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2106956909362746910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9770111070268720795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 23:49:19] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:49:19] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:49:19] [INFO ] Time to serialize gal into /tmp/LTL11732019243068613967.gal : 3 ms
[2025-05-30 23:49:19] [INFO ] Time to serialize properties into /tmp/LTL16751879770601638207.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11732019243068613967.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4059463451021645227.hoa' '-atoms' '/tmp/LTL16751879770601638207.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16751879770601638207.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4059463451021645227.hoa
Detected timeout of ITS tools.
[2025-05-30 23:49:34] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:49:34] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:49:34] [INFO ] Time to serialize gal into /tmp/LTL1395868587043240163.gal : 2 ms
[2025-05-30 23:49:34] [INFO ] Time to serialize properties into /tmp/LTL552489475078952139.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1395868587043240163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL552489475078952139.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("(Server_Waiting<=(((((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Client...6288
Formula 0 simplified : XXXG!"(Server_Waiting<=(((((((Client_Waiting_0+Client_Waiting_1)+(Client_Waiting_2+Client_Waiting_3))+((Client_Waiting_4+Client_Wait...6266
Detected timeout of ITS tools.
[2025-05-30 23:49:49] [INFO ] Flatten gal took : 15 ms
[2025-05-30 23:49:49] [INFO ] Applying decomposition
[2025-05-30 23:49:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6560594539006817061.txt' '-o' '/tmp/graph6560594539006817061.bin' '-w' '/tmp/graph6560594539006817061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6560594539006817061.bin' '-l' '-1' '-v' '-w' '/tmp/graph6560594539006817061.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:49:49] [INFO ] Decomposing Gal with order
[2025-05-30 23:49:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:49:49] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-30 23:49:49] [INFO ] Flatten gal took : 99 ms
[2025-05-30 23:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 23:49:49] [INFO ] Time to serialize gal into /tmp/LTL11200608644709096829.gal : 3 ms
[2025-05-30 23:49:49] [INFO ] Time to serialize properties into /tmp/LTL4476880770177766472.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11200608644709096829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4476880770177766472.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(F("(gu1.Server_Waiting<=(((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+(gu1.Client_Waiting_2+gu1.Client_Waiting_3))+((gu1...7496
Formula 0 simplified : XXXG!"(gu1.Server_Waiting<=(((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+(gu1.Client_Waiting_2+gu1.Client_Waiting_3))+((gu1.Clie...7474
Detected timeout of ITS tools.
Treatment of property CSRepetitions-COL-10-LTLCardinality-14 finished in 325155 ms.
[2025-05-30 23:50:04] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15608176959776144589
[2025-05-30 23:50:04] [INFO ] Applying decomposition
[2025-05-30 23:50:04] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2025-05-30 23:50:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:50:04] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:50:04] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2025-05-30 23:50:04] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8949213606609998843.txt' '-o' '/tmp/graph8949213606609998843.bin' '-w' '/tmp/graph8949213606609998843.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8949213606609998843.bin' '-l' '-1' '-v' '-w' '/tmp/graph8949213606609998843.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:50:04] [INFO ] Decomposing Gal with order
[2025-05-30 23:50:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:50:04] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2025-05-30 23:50:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:50:04] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15608176959776144589
Running compilation step : cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 23:50:04] [INFO ] Removed a total of 99 redundant transitions.
[2025-05-30 23:50:04] [INFO ] Flatten gal took : 113 ms
[2025-05-30 23:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 23:50:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality7362817431602300524.gal : 3 ms
[2025-05-30 23:50:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality9428903306688990845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7362817431602300524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9428903306688990845.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((((((gu2.Client_Waiting_0+gu2.Client_Waiting_1)+(gu2.Client_Waiting_2+gu2.Client_Waiting_3))+((gu2.Client_Waiting_4+gu2.Cl...4846
Formula 0 simplified : G(F!"((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+((gu0.Client_Sending_4+gu0.Clie...4839
Compilation finished in 1177 ms.
Running link step : cd /tmp/ltsmin15608176959776144589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(X(X((LTLAPp2==true)))))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.035: LTL layer: formula: X((X(X(X(X((LTLAPp2==true)))))&&<>((LTLAPp3==true))))
pins2lts-mc-linux64( 1/ 8), 0.035: "X((X(X(X(X((LTLAPp2==true)))))&&<>((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.036: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.164: DFS-FIFO for weak LTL, using special progress label 508
pins2lts-mc-linux64( 0/ 8), 0.164: There are 509 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.164: State length is 403, there are 517 groups
pins2lts-mc-linux64( 0/ 8), 0.164: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.164: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.164: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.164: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.745: ~1 levels ~960 states ~96032 transitions
pins2lts-mc-linux64( 2/ 8), 1.039: ~1 levels ~1920 states ~192288 transitions
pins2lts-mc-linux64( 2/ 8), 1.461: ~1 levels ~3840 states ~384384 transitions
pins2lts-mc-linux64( 2/ 8), 2.181: ~1 levels ~7680 states ~768480 transitions
pins2lts-mc-linux64( 5/ 8), 3.532: ~1 levels ~15360 states ~1539136 transitions
pins2lts-mc-linux64( 5/ 8), 5.534: ~1 levels ~30720 states ~3077368 transitions
pins2lts-mc-linux64( 5/ 8), 9.091: ~1 levels ~61440 states ~6152872 transitions
pins2lts-mc-linux64( 5/ 8), 16.730: ~1 levels ~122880 states ~12300920 transitions
pins2lts-mc-linux64( 5/ 8), 32.132: ~1 levels ~245760 states ~24609528 transitions
pins2lts-mc-linux64( 5/ 8), 56.437: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 57.780:
pins2lts-mc-linux64( 0/ 8), 57.780: mean standard work distribution: 1.1% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 57.780:
pins2lts-mc-linux64( 0/ 8), 57.780: Explored 400139 states 40129933 transitions, fanout: 100.290
pins2lts-mc-linux64( 0/ 8), 57.780: Total exploration time 57.610 sec (56.300 sec minimum, 56.939 sec on average)
pins2lts-mc-linux64( 0/ 8), 57.780: States per second: 6946, Transitions per second: 696579
pins2lts-mc-linux64( 0/ 8), 57.780:
pins2lts-mc-linux64( 0/ 8), 57.780: Progress states detected: 14818230
pins2lts-mc-linux64( 0/ 8), 57.780: Redundant explorations: -97.2998
pins2lts-mc-linux64( 0/ 8), 57.780:
pins2lts-mc-linux64( 0/ 8), 57.780: Queue width: 8B, total height: 18854768, memory: 143.85MB
pins2lts-mc-linux64( 0/ 8), 57.780: Tree memory: 369.1MB, 26.1 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 57.780: Tree fill ratio (roots/leafs): 11.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 57.780: Stored 555 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 57.780: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 57.780: Est. total memory use: 512.9MB (~1167.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(X(X((LTLAPp2==true)))))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15608176959776144589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(X(X((LTLAPp2==true)))))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854029000731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-10.tgz
mv CSRepetitions-COL-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;