About the Execution of ITS-Tools for DatabaseWithMutex-PT-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 | ?FTTTFT?FFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029200843.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 DatabaseWithMutex-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029200843
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 127K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 596K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 656K 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.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 60K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 202K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 264K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 435K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 840K 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 DatabaseWithMutex-PT-10-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748670174773
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 05:42: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-31 05:42:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:42:56] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-05-31 05:42:56] [INFO ] Transformed 830 places.
[2025-05-31 05:42:56] [INFO ] Transformed 800 transitions.
[2025-05-31 05:42:56] [INFO ] Found NUPN structural information;
[2025-05-31 05:42:56] [INFO ] Parsed PT model containing 830 places and 800 transitions and 3800 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 723 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 57 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:42:56] [INFO ] Computed 130 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:42:57] [INFO ] Implicit Places using invariants in 840 ms returned []
[2025-05-31 05:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:42:58] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:08] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
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 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30033 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:33] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:43:56] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30016 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Finished structural reductions in LTL mode , in 1 iterations and 62238 ms. Remains : 830/830 places, 800/800 transitions.
Support contains 723 out of 830 places after structural reductions.
[2025-05-31 05:43:58] [INFO ] Flatten gal took : 101 ms
[2025-05-31 05:43:59] [INFO ] Flatten gal took : 66 ms
[2025-05-31 05:43:59] [INFO ] Input system was already deterministic with 800 transitions.
RANDOM walk for 40000 steps (8 resets) in 1299 ms. (30 steps per ms) remains 1/26 properties
BEST_FIRST walk for 4851 steps (0 resets) in 55 ms. (86 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 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' '!(((p0 U p1) U X((X(p2)&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 43 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:44:06] [INFO ] Implicit Places using invariants in 6041 ms returned []
[2025-05-31 05:44:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:44:09] [INFO ] Implicit Places using invariants and state equation in 2813 ms returned []
Implicit Place search using SMT with State Equation took 8862 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:18] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:19] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:26] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:37] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30032 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:53] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:44:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
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 Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30024 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in LTL mode , in 1 iterations and 69157 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 755 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), (NOT p2), p0, p0, true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 524 reset in 816 ms.
Product exploration explored 100000 steps with 586 reset in 771 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 166 ms. Reduced automaton from 14 states, 35 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, p0]
RANDOM walk for 710 steps (0 resets) in 16 ms. (41 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0, p0]
Support contains 110 out of 830 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:18] [INFO ] Implicit Places using invariants in 6006 ms returned []
[2025-05-31 05:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:21] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 8809 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:31] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:32] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:38] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30018 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:45:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:05] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30018 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in LTL mode , in 1 iterations and 69033 ms. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[p0, p0, p0, p0]
RANDOM walk for 324 steps (0 resets) in 7 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 288 reset in 761 ms.
Product exploration explored 100000 steps with 290 reset in 776 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 800
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 200 place count 830 transition count 800
Deduced a syphon composed of 200 places in 1 ms
Applied a total of 200 rules in 143 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:46:24] [INFO ] Redundant transitions in 44 ms returned []
Running 700 sub problems to find dead transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:46:24] [INFO ] Computed 130 invariants in 26 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:33] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 4 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:34] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD599 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 20/930 constraints. Problems are: Problem set: 96 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:41] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:41] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:42] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:43] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 3 ms to minimize.
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 20/950 constraints. Problems are: Problem set: 123 solved, 577 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:44] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:45] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:45] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:45] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:45] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:46] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD495 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 20/970 constraints. Problems are: Problem set: 137 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:48] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:50] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:50] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD252 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:50] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD263 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:50] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:51] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:51] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 5 ms to minimize.
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:51] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD397 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:51] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD421 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:46:52] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD559 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 20/990 constraints. Problems are: Problem set: 150 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 990 constraints, problems are : Problem set: 150 solved, 550 unsolved in 30015 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 150 solved, 550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 670/670 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 10/680 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 3/683 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/670 variables, 80/763 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 0/763 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 5 (OVERLAPS) 97/767 variables, 9/772 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 97/869 constraints. Problems are: Problem set: 150 solved, 550 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 12/881 constraints. Problems are: Problem set: 150 solved, 550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:07] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:07] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:08] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD325 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:09] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD468 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:09] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:09] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD507 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
Problem TDEAD575 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD584 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD586 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:47:10] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD595 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD583 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/767 variables, 13/894 constraints. Problems are: Problem set: 163 solved, 537 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/767 variables, 0/894 constraints. Problems are: Problem set: 163 solved, 537 unsolved
At refinement iteration 10 (OVERLAPS) 63/830 variables, 96/990 constraints. Problems are: Problem set: 163 solved, 537 unsolved
SMT process timed out in 60223ms, After SMT, problems are : Problem set: 163 solved, 537 unsolved
Search for dead transitions found 163 dead transitions in 60226ms
Found 163 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 163 transitions
Dead transitions reduction (with SMT) removed 163 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 830/830 places, 637/800 transitions.
Graph (complete) has 3127 edges and 830 vertex of which 667 are kept as prefixes of interest. Removing 163 places using SCC suffix rule.3 ms
Discarding 163 places :
Also discarding 0 output transitions
Deduced a syphon composed of 37 places in 1 ms
Applied a total of 1 rules in 31 ms. Remains 667 /830 variables (removed 163) and now considering 637/637 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 667/830 places, 637/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60456 ms. Remains : 667/830 places, 637/800 transitions.
Built C files in :
/tmp/ltsmin639884425569861033
[2025-05-31 05:47:25] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin639884425569861033
Running compilation step : cd /tmp/ltsmin639884425569861033;'/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 1612 ms.
Running link step : cd /tmp/ltsmin639884425569861033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin639884425569861033;'/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/stateBased3428662560613368704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:47:40] [INFO ] Computed 130 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:51] [INFO ] Implicit Places using invariants in 11037 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 11047 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11069 ms. Remains : 730/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin7871242175955562787
[2025-05-31 05:47:51] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7871242175955562787
Running compilation step : cd /tmp/ltsmin7871242175955562787;'/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 1419 ms.
Running link step : cd /tmp/ltsmin7871242175955562787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7871242175955562787;'/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/stateBased480708896809406936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:48:06] [INFO ] Flatten gal took : 47 ms
[2025-05-31 05:48:06] [INFO ] Flatten gal took : 36 ms
[2025-05-31 05:48:06] [INFO ] Time to serialize gal into /tmp/LTL10535450332390147302.gal : 8 ms
[2025-05-31 05:48:06] [INFO ] Time to serialize properties into /tmp/LTL6405031245938771675.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/LTL10535450332390147302.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16503694945744825608.hoa' '-atoms' '/tmp/LTL6405031245938771675.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/LTL6405031245938771675.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16503694945744825608.hoa
Detected timeout of ITS tools.
[2025-05-31 05:48:21] [INFO ] Flatten gal took : 39 ms
[2025-05-31 05:48:21] [INFO ] Flatten gal took : 52 ms
[2025-05-31 05:48:21] [INFO ] Time to serialize gal into /tmp/LTL3994088368981350274.gal : 8 ms
[2025-05-31 05:48:21] [INFO ] Time to serialize properties into /tmp/LTL11849949309610988825.ltl : 3 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/LTL3994088368981350274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11849949309610988825.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 : !(((("((((((((RecBuff_4_8+RecBuff_7_10)+(RecBuff_6_8+RecBuff_3_9))+((RecBuff_7_4+RecBuff_9_3)+(RecBuff_2_2+RecBuff_10_9)))+(((RecBuff_...6162
Formula 0 simplified : (!"((((((((RecBuff_4_8+RecBuff_7_10)+(RecBuff_6_8+RecBuff_3_9))+((RecBuff_7_4+RecBuff_9_3)+(RecBuff_2_2+RecBuff_10_9)))+(((RecBuff_8...6148
Detected timeout of ITS tools.
[2025-05-31 05:48:36] [INFO ] Flatten gal took : 35 ms
[2025-05-31 05:48:36] [INFO ] Applying decomposition
[2025-05-31 05:48:36] [INFO ] Flatten gal took : 32 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/graph5839797253635937861.txt' '-o' '/tmp/graph5839797253635937861.bin' '-w' '/tmp/graph5839797253635937861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5839797253635937861.bin' '-l' '-1' '-v' '-w' '/tmp/graph5839797253635937861.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:48:37] [INFO ] Decomposing Gal with order
[2025-05-31 05:48:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:48:37] [INFO ] Removed a total of 980 redundant transitions.
[2025-05-31 05:48:37] [INFO ] Flatten gal took : 364 ms
[2025-05-31 05:48:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2025-05-31 05:48:37] [INFO ] Time to serialize gal into /tmp/LTL15438574469589534715.gal : 11 ms
[2025-05-31 05:48:37] [INFO ] Time to serialize properties into /tmp/LTL10504585006216575271.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/LTL15438574469589534715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10504585006216575271.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 : !(((("((((((((gu0.RecBuff_4_8+gu0.RecBuff_7_10)+(gu0.RecBuff_6_8+gu0.RecBuff_3_9))+((gu0.RecBuff_7_4+gu0.RecBuff_9_3)+(gu0.RecBuff_2_2...8152
Formula 0 simplified : (!"((((((((gu0.RecBuff_4_8+gu0.RecBuff_7_10)+(gu0.RecBuff_6_8+gu0.RecBuff_3_9))+((gu0.RecBuff_7_4+gu0.RecBuff_9_3)+(gu0.RecBuff_2_2+...8138
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-00 finished in 292836 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(G(p0))&&F(p1))))'
Support contains 300 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 200 Pre rules applied. Total rules applied 0 place count 830 transition count 600
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 48 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
// Phase 1: matrix 600 rows 630 cols
[2025-05-31 05:48:52] [INFO ] Computed 130 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:59] [INFO ] Implicit Places using invariants in 6914 ms returned []
[2025-05-31 05:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:49:05] [INFO ] Implicit Places using invariants and state equation in 5316 ms returned []
Implicit Place search using SMT with State Equation took 12241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:49:05] [INFO ] Redundant transitions in 8 ms returned []
Running 500 sub problems to find dead transitions.
[2025-05-31 05:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/646 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 62/708 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:12] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:30] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 5/730 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
(s629 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1230 variables, and 731 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30017 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 62/104 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/646 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 62/708 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 23/731 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:39] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:39] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 7/738 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:49:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 10/630 variables, 42/781 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 10/791 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/1230 variables, and 791 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30019 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 630/830 places, 600/800 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72445 ms. Remains : 630/830 places, 600/800 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 919 ms.
Product exploration explored 100000 steps with 0 reset in 1031 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 107 steps (0 resets) in 8 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-05-31 05:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:50:11] [INFO ] [Real]Absence check using 26 positive place invariants in 355 ms returned sat
[2025-05-31 05:50:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 05:50:23] [INFO ] [Real]Absence check using 26 positive and 104 generalized place invariants in 11512 ms returned unknown
Could not prove EG (NOT p0)
Support contains 300 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 600/600 transitions.
Applied a total of 0 rules in 19 ms. Remains 630 /630 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2025-05-31 05:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:29] [INFO ] Implicit Places using invariants in 6758 ms returned []
[2025-05-31 05:50:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:35] [INFO ] Implicit Places using invariants and state equation in 5334 ms returned []
Implicit Place search using SMT with State Equation took 12101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:50:35] [INFO ] Redundant transitions in 8 ms returned []
Running 500 sub problems to find dead transitions.
[2025-05-31 05:50:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/646 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 62/708 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 6/714 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:50] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:52] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/725 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:58] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:50:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 5/730 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1230 variables, and 731 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30019 ms.
Refiners :[Domain max(s): 620/630 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 62/104 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 620/620 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 26/646 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 62/708 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 23/731 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:08] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:09] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:09] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:09] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 7/738 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:51:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 10/630 variables, 42/781 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 10/791 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/1230 variables, and 791 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30019 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72304 ms. Remains : 630/630 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 108 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-05-31 05:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:51:39] [INFO ] [Real]Absence check using 26 positive place invariants in 357 ms returned sat
[2025-05-31 05:51:51] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 05:51:51] [INFO ] [Real]Absence check using 26 positive and 104 generalized place invariants in 11471 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 914 ms.
Product exploration explored 100000 steps with 0 reset in 997 ms.
Built C files in :
/tmp/ltsmin11385723071031927297
[2025-05-31 05:51:53] [INFO ] Computing symmetric may disable matrix : 600 transitions.
[2025-05-31 05:51:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:53] [INFO ] Computing symmetric may enable matrix : 600 transitions.
[2025-05-31 05:51:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:53] [INFO ] Computing Do-Not-Accords matrix : 600 transitions.
[2025-05-31 05:51:53] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:53] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11385723071031927297
Running compilation step : cd /tmp/ltsmin11385723071031927297;'/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 1727 ms.
Running link step : cd /tmp/ltsmin11385723071031927297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11385723071031927297;'/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/stateBased13440210712222915691.hoa' '--buchi-type=spotba'
LTSmin run took 10275 ms.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-01 finished in 192473 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 U (p0&&(p1||G(p0)))) U ((X(X((X(!p2)||F(p1))))&&(p0 U (p0&&(p1||G(p0)))))||G((p0 U (p0&&(p1||G(p0))))))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:52:05] [INFO ] Computed 130 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:52:16] [INFO ] Implicit Places using invariants in 11115 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 11123 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 24 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11161 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 467 ms :[(NOT p0), true, (AND (NOT p0) (NOT p1) p2), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p0) p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 1037 ms.
Product exploration explored 100000 steps with 33333 reset in 1059 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-02 finished in 13847 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 U p1) U p2) U (!p1||(p0&&F(p3))))))'
Support contains 420 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:52:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:52:20] [INFO ] Implicit Places using invariants in 768 ms returned []
[2025-05-31 05:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:52:20] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:30] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:49] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30019 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:52:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:09] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
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 Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30015 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 61559 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p3))), (OR (AND (NOT p0) p1) (AND p1 (NOT p3))), (NOT p2), (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 1679 ms.
Product exploration explored 100000 steps with 50000 reset in 1684 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0 (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 20 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-03 finished in 65832 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)&&F(p1))||X(G(p0))))'
Support contains 200 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:53:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:53:29] [INFO ] Implicit Places using invariants in 4010 ms returned []
[2025-05-31 05:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:53:32] [INFO ] Implicit Places using invariants and state equation in 3181 ms returned []
Implicit Place search using SMT with State Equation took 7202 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:49] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:53:59] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:00] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
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 820/1630 variables, and 917 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30027 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 7/917 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:07] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:15] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:18] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 3/921 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 923 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30014 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in LTL mode , in 1 iterations and 67376 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 813 ms.
Product exploration explored 100000 steps with 50000 reset in 757 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-06 finished in 69248 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||X(X(p0))||F(p1))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:54:40] [INFO ] Implicit Places using invariants in 6653 ms returned []
[2025-05-31 05:54:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:54:43] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 9302 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:54:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:11] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 916 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30015 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 6/916 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:27] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:55:39] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 921 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30022 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Finished structural reductions in LTL mode , in 1 iterations and 69508 ms. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 1735 reset in 685 ms.
Product exploration explored 100000 steps with 1718 reset in 709 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 305 steps (0 resets) in 13 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-05-31 05:55:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 05:56:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:56:08] [INFO ] Implicit Places using invariants in 6651 ms returned []
[2025-05-31 05:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:56:10] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 9351 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:20] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 917 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30026 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 7/917 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:57] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:56:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 3/921 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:04] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1630 variables, and 923 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30017 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in LTL mode , in 1 iterations and 69578 ms. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 237 steps (0 resets) in 20 ms. (11 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2025-05-31 05:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1723 reset in 674 ms.
Product exploration explored 100000 steps with 1720 reset in 703 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 830 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 100 rules in 31 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:57:28] [INFO ] Redundant transitions in 10 ms returned []
Running 700 sub problems to find dead transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:57:28] [INFO ] Computed 130 invariants in 11 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:37] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:37] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:39] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
Problem TDEAD193 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:40] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD581 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 20/930 constraints. Problems are: Problem set: 19 solved, 681 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:51] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
Problem TDEAD233 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Problem TDEAD298 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Problem TDEAD299 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:53] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Problem TDEAD307 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD668 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 20/950 constraints. Problems are: Problem set: 34 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:55] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Problem TDEAD340 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Problem TDEAD343 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Problem TDEAD347 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 5 ms to minimize.
Problem TDEAD369 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:58] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Problem TDEAD401 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:57:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 966 constraints, problems are : Problem set: 41 solved, 659 unsolved in 30028 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 779/779 constraints. Problems are: Problem set: 41 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 18/797 constraints. Problems are: Problem set: 41 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/779 variables, 25/822 constraints. Problems are: Problem set: 41 solved, 659 unsolved
Problem TDEAD372 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD657 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/779 variables, 56/878 constraints. Problems are: Problem set: 45 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:00] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
Problem TDEAD458 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Problem TDEAD481 is UNSAT
Problem TDEAD505 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Problem TDEAD514 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Problem TDEAD558 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Problem TDEAD619 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:06] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
Problem TDEAD637 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
Problem TDEAD656 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
Problem TDEAD438 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD660 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/779 variables, 17/895 constraints. Problems are: Problem set: 62 solved, 638 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 0/895 constraints. Problems are: Problem set: 62 solved, 638 unsolved
At refinement iteration 6 (OVERLAPS) 1/780 variables, 1/896 constraints. Problems are: Problem set: 62 solved, 638 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/780 variables, 1/897 constraints. Problems are: Problem set: 62 solved, 638 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/780 variables, 4/901 constraints. Problems are: Problem set: 62 solved, 638 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Problem TDEAD410 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:58:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Problem TDEAD472 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/1630 variables, and 903 constraints, problems are : Problem set: 64 solved, 636 unsolved in 30022 ms.
Refiners :[Domain max(s): 780/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 29/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 64 solved, 636 unsolved
Search for dead transitions found 64 dead transitions in 60214ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 830/830 places, 736/800 transitions.
Graph (complete) has 3036 edges and 830 vertex of which 766 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1 rules in 28 ms. Remains 766 /830 variables (removed 64) and now considering 736/736 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 766/830 places, 736/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60299 ms. Remains : 766/830 places, 736/800 transitions.
Built C files in :
/tmp/ltsmin6016958751783416789
[2025-05-31 05:58:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6016958751783416789
Running compilation step : cd /tmp/ltsmin6016958751783416789;'/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 1559 ms.
Running link step : cd /tmp/ltsmin6016958751783416789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6016958751783416789;'/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/stateBased10567744804749487872.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 19 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 05:58:44] [INFO ] Computed 130 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:58:49] [INFO ] Implicit Places using invariants in 5365 ms returned []
[2025-05-31 05:58:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:58:52] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 7993 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 05:58:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:09] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:19] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1630 variables, and 917 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30021 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 820/820 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 19/839 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 71/910 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/820 variables, 7/917 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:35] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:39] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 3/921 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:59:51] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 3 ms to minimize.
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 Int declared 820/1630 variables, and 923 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30020 ms.
Refiners :[Domain max(s): 820/830 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 71/111 constraints, State Equation: 0/830 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in LTL mode , in 1 iterations and 68182 ms. Remains : 830/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin5030444827152804154
[2025-05-31 05:59:52] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5030444827152804154
Running compilation step : cd /tmp/ltsmin5030444827152804154;'/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 1558 ms.
Running link step : cd /tmp/ltsmin5030444827152804154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5030444827152804154;'/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/stateBased3969294301474933843.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 06:00:07] [INFO ] Flatten gal took : 39 ms
[2025-05-31 06:00:07] [INFO ] Flatten gal took : 33 ms
[2025-05-31 06:00:07] [INFO ] Time to serialize gal into /tmp/LTL9925551317885364247.gal : 7 ms
[2025-05-31 06:00:07] [INFO ] Time to serialize properties into /tmp/LTL16738766287207532226.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/LTL9925551317885364247.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13295022220210903254.hoa' '-atoms' '/tmp/LTL16738766287207532226.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/LTL16738766287207532226.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13295022220210903254.hoa
Detected timeout of ITS tools.
[2025-05-31 06:00:22] [INFO ] Flatten gal took : 32 ms
[2025-05-31 06:00:22] [INFO ] Flatten gal took : 31 ms
[2025-05-31 06:00:22] [INFO ] Time to serialize gal into /tmp/LTL8291054315494141089.gal : 6 ms
[2025-05-31 06:00:22] [INFO ] Time to serialize properties into /tmp/LTL11396974185886626784.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/LTL8291054315494141089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11396974185886626784.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((("((((((((Active_10_8+Active_5_6)+(Active_1_1+Active_2_7))+((Active_2_8+Active_5_4)+(Active_2_9+Active_3_7)))+(((Active_8_2+Acti...4934
Formula 0 simplified : X(!"((((((((Active_10_8+Active_5_6)+(Active_1_1+Active_2_7))+((Active_2_8+Active_5_4)+(Active_2_9+Active_3_7)))+(((Active_8_2+Active...4922
Detected timeout of ITS tools.
[2025-05-31 06:00:37] [INFO ] Flatten gal took : 28 ms
[2025-05-31 06:00:37] [INFO ] Applying decomposition
[2025-05-31 06:00:37] [INFO ] Flatten gal took : 29 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/graph16115040485863686827.txt' '-o' '/tmp/graph16115040485863686827.bin' '-w' '/tmp/graph16115040485863686827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16115040485863686827.bin' '-l' '-1' '-v' '-w' '/tmp/graph16115040485863686827.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:00:38] [INFO ] Decomposing Gal with order
[2025-05-31 06:00:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:00:38] [INFO ] Removed a total of 1107 redundant transitions.
[2025-05-31 06:00:38] [INFO ] Flatten gal took : 134 ms
[2025-05-31 06:00:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 52 ms.
[2025-05-31 06:00:38] [INFO ] Time to serialize gal into /tmp/LTL7015482458595095122.gal : 12 ms
[2025-05-31 06:00:38] [INFO ] Time to serialize properties into /tmp/LTL4953263752215197633.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/LTL7015482458595095122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4953263752215197633.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((("((((((((gu6.Active_10_8+gu6.Active_5_6)+(gu6.Active_1_1+gu6.Active_2_7))+((gu6.Active_2_8+gu6.Active_5_4)+(gu6.Active_2_9+gu6....6214
Formula 0 simplified : X(!"((((((((gu6.Active_10_8+gu6.Active_5_6)+(gu6.Active_1_1+gu6.Active_2_7))+((gu6.Active_2_8+gu6.Active_5_4)+(gu6.Active_2_9+gu6.Ac...6202
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-07 finished in 379253 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(G((F(p1)&&p0))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 06:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:06] [INFO ] Implicit Places using invariants in 12769 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 12775 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12795 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-08 finished in 12920 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((G(p1)||p0))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 06:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:20] [INFO ] Implicit Places using invariants in 13814 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 13820 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/830 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13849 ms. Remains : 731/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 578 ms.
Product exploration explored 100000 steps with 33333 reset in 601 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-10 finished in 15276 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((p0&&X(F(p1))))))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2025-05-31 06:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:34] [INFO ] Implicit Places using invariants in 12864 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 12873 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12908 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-12 finished in 13116 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((p0||G(p1))))'
Support contains 3 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 830 transition count 610
Reduce places removed 200 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 1 with 399 rules applied. Total rules applied 589 place count 630 transition count 411
Reduce places removed 199 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 209 rules applied. Total rules applied 798 place count 431 transition count 401
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 808 place count 421 transition count 401
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 808 place count 421 transition count 301
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 1008 place count 321 transition count 301
Applied a total of 1008 rules in 33 ms. Remains 321 /830 variables (removed 509) and now considering 301/800 (removed 499) transitions.
// Phase 1: matrix 301 rows 321 cols
[2025-05-31 06:01:34] [INFO ] Computed 120 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:45] [INFO ] Implicit Places using invariants in 10335 ms returned [0, 4, 7, 10, 12, 13, 14, 16, 17, 18, 19, 22, 23, 24, 25, 26, 28, 30, 32, 36, 38, 39, 40, 42, 44, 46, 47, 49, 50, 51, 52, 54, 55, 56, 58, 61, 62, 66, 67, 71, 72, 73, 74, 75, 81, 82, 83, 84, 85, 86, 90, 91, 92, 93, 94, 95, 96, 97, 98, 101, 102, 104, 105, 107, 108, 111, 112, 113, 115, 116, 118, 119, 120, 121, 125, 127, 128, 129, 130, 131, 132, 135, 136, 140, 141, 145, 146, 147, 150, 153, 155, 156, 157, 159, 160, 161, 162, 164, 165, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 181, 182, 183, 184, 185, 187, 188, 190, 193, 194, 196, 198, 201, 202, 204, 205, 209, 210, 212, 213, 214, 215, 216, 219, 220, 221, 222, 224, 226, 227, 229, 230, 231, 232, 234, 235, 236, 237, 238, 239, 240, 242, 244, 246, 248, 252, 256, 257, 258, 260, 261, 262, 264, 267, 268, 269, 272, 273, 275, 276, 277, 278, 279, 281, 282, 283, 284, 285, 287, 288, 289, 290, 291, 295, 297, 298, 299, 301, 302, 303, 306, 307, 308, 310, 311, 312, 313, 314, 317, 319]
[2025-05-31 06:01:45] [INFO ] Actually due to overlaps returned [0, 4, 12, 13, 14, 18, 19, 25, 26, 32, 84, 108, 129, 140, 160, 226, 278, 289, 301, 317]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 10341 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/830 places, 301/800 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10384 ms. Remains : 301/830 places, 301/800 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 2249 reset in 646 ms.
Stack based approach found an accepted trace after 391 steps with 9 reset with depth 15 and stack size 15 in 3 ms.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-13 finished in 11088 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((F(p0) U (F(p1)&&G(p2)))))'
Support contains 4 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2025-05-31 06:01:45] [INFO ] Computed 130 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:58] [INFO ] Implicit Places using invariants in 12856 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 12861 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12891 ms. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 149 reset in 458 ms.
Product exploration explored 100000 steps with 145 reset in 461 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 259 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 4006 steps (0 resets) in 53 ms. (74 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p1))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 4 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 730 cols
[2025-05-31 06:02:01] [INFO ] Computed 30 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:02:07] [INFO ] Implicit Places using invariants in 5829 ms returned []
[2025-05-31 06:02:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:02:19] [INFO ] Implicit Places using invariants and state equation in 11754 ms returned []
Implicit Place search using SMT with State Equation took 17587 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2025-05-31 06:02:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/720 variables, 18/738 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:28] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:28] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:30] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/720 variables, 20/758 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:30] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:30] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:30] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:30] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:31] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:40] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 20/798 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:43] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:44] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:44] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:44] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 20/818 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:46] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:47] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:02:48] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 20/838 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 720/1530 variables, and 838 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30020 ms.
Refiners :[Domain max(s): 720/730 constraints, Positive P Invariants (semi-flows): 18/21 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/720 variables, 18/738 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/720 variables, 100/838 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
SMT process timed out in 60156ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in LTL mode , in 1 iterations and 77770 ms. Remains : 730/730 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
RANDOM walk for 1596 steps (0 resets) in 22 ms. (69 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p1))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 148 reset in 442 ms.
Product exploration explored 100000 steps with 135 reset in 469 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 4 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 730 transition count 800
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 99 Pre rules applied. Total rules applied 190 place count 730 transition count 800
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 289 place count 730 transition count 800
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 387 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 387 place count 730 transition count 800
Deduced a syphon composed of 387 places in 1 ms
Applied a total of 387 rules in 105 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:03:22] [INFO ] Redundant transitions in 11 ms returned []
Running 700 sub problems to find dead transitions.
// Phase 1: matrix 800 rows 730 cols
[2025-05-31 06:03:22] [INFO ] Computed 30 invariants in 19 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/720 variables, 18/738 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:29] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:30] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:31] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:32] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:32] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 6 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/720 variables, 20/758 constraints. Problems are: Problem set: 60 solved, 640 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:32] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:32] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:32] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:33] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:34] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:35] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:35] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:35] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 20/778 constraints. Problems are: Problem set: 60 solved, 640 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:41] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:42] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 1 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/720 variables, 20/798 constraints. Problems are: Problem set: 81 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:44] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:45] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:46] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:46] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:46] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 20/818 constraints. Problems are: Problem set: 81 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:46] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:47] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:48] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/720 variables, 20/838 constraints. Problems are: Problem set: 81 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 720/1530 variables, and 838 constraints, problems are : Problem set: 81 solved, 619 unsolved in 30014 ms.
Refiners :[Domain max(s): 720/730 constraints, Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 81 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 639/639 constraints. Problems are: Problem set: 81 solved, 619 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 9/648 constraints. Problems are: Problem set: 81 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 100/748 constraints. Problems are: Problem set: 81 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:54] [INFO ] Deduced a trap composed of 1 places in 41 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD516 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:56] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 1 ms to minimize.
Problem TDEAD519 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD522 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:56] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD567 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD743 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:03:58] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 2 ms to minimize.
Problem TDEAD764 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD707 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 5/753 constraints. Problems are: Problem set: 130 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/753 constraints. Problems are: Problem set: 130 solved, 570 unsolved
At refinement iteration 5 (OVERLAPS) 91/730 variables, 13/766 constraints. Problems are: Problem set: 130 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 91/857 constraints. Problems are: Problem set: 130 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 8/865 constraints. Problems are: Problem set: 130 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/1530 variables, and 865 constraints, problems are : Problem set: 130 solved, 570 unsolved in 30028 ms.
Refiners :[Domain max(s): 730/730 constraints, Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60272ms problems are : Problem set: 130 solved, 570 unsolved
Search for dead transitions found 130 dead transitions in 60273ms
Found 130 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 130 transitions
Dead transitions reduction (with SMT) removed 130 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 730/730 places, 670/800 transitions.
Graph (complete) has 2986 edges and 730 vertex of which 600 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.3 ms
Discarding 130 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 595 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 595 transition count 670
Deduced a syphon composed of 259 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 595 transition count 670
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 53 place count 545 transition count 620
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 103 place count 545 transition count 620
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 257 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 151 place count 545 transition count 620
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 199 place count 497 transition count 572
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 247 place count 497 transition count 572
Deduced a syphon composed of 209 places in 1 ms
Applied a total of 247 rules in 97 ms. Remains 497 /730 variables (removed 233) and now considering 572/670 (removed 98) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 497/730 places, 572/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60497 ms. Remains : 497/730 places, 572/800 transitions.
Built C files in :
/tmp/ltsmin12014101240007068771
[2025-05-31 06:04:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12014101240007068771
Running compilation step : cd /tmp/ltsmin12014101240007068771;'/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 1456 ms.
Running link step : cd /tmp/ltsmin12014101240007068771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12014101240007068771;'/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/stateBased13646710580181234333.hoa' '--buchi-type=spotba'
LTSmin run took 647 ms.
FORMULA DatabaseWithMutex-PT-10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLCardinality-14 finished in 158851 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 U p1) U X((X(p2)&&F((G(F(!p0))||(!p1&&F(!p0))))))))'
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||X(X(p0))||F(p1))))'
[2025-05-31 06:04:25] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4841393467420833517
[2025-05-31 06:04:25] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2025-05-31 06:04:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 06:04:25] [INFO ] Applying decomposition
[2025-05-31 06:04:25] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2025-05-31 06:04:25] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 06:04:25] [INFO ] Flatten gal took : 28 ms
[2025-05-31 06:04:25] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2025-05-31 06:04:25] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 06:04:25] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4841393467420833517
Running compilation step : cd /tmp/ltsmin4841393467420833517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
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/graph7967730858278171763.txt' '-o' '/tmp/graph7967730858278171763.bin' '-w' '/tmp/graph7967730858278171763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7967730858278171763.bin' '-l' '-1' '-v' '-w' '/tmp/graph7967730858278171763.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:04:25] [INFO ] Decomposing Gal with order
[2025-05-31 06:04:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:04:25] [INFO ] Removed a total of 376 redundant transitions.
[2025-05-31 06:04:25] [INFO ] Flatten gal took : 149 ms
[2025-05-31 06:04:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 12 ms.
[2025-05-31 06:04:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality8509944902945024431.gal : 7 ms
[2025-05-31 06:04:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality2901232227011732298.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/LTLCardinality8509944902945024431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2901232227011732298.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 2 LTL properties
Checking formula 0 : !(((("((((((((gu0.RecBuff_4_8+gu0.RecBuff_7_10)+(gu0.RecBuff_6_8+gu0.RecBuff_3_9))+((gu0.RecBuff_7_4+gu0.RecBuff_9_3)+(gu0.RecBuff_2_2...7882
Formula 0 simplified : (!"((((((((gu0.RecBuff_4_8+gu0.RecBuff_7_10)+(gu0.RecBuff_6_8+gu0.RecBuff_3_9))+((gu0.RecBuff_7_4+gu0.RecBuff_9_3)+(gu0.RecBuff_2_2+...7868
Compilation finished in 2377 ms.
Running link step : cd /tmp/ltsmin4841393467420833517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4841393467420833517;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U X((X((LTLAPp2==true))&&<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.065: LTL layer: formula: (((LTLAPp0==true) U (LTLAPp1==true)) U X((X((LTLAPp2==true))&&<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.066: "(((LTLAPp0==true) U (LTLAPp1==true)) U X((X((LTLAPp2==true))&&<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.066: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.112: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.351: DFS-FIFO for weak LTL, using special progress label 806
pins2lts-mc-linux64( 0/ 8), 0.351: There are 807 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.351: State length is 831, there are 838 groups
pins2lts-mc-linux64( 0/ 8), 0.351: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.351: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.351: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.351: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.413: ~2 levels ~960 states ~3712 transitions
pins2lts-mc-linux64( 4/ 8), 0.450: ~2 levels ~1920 states ~5168 transitions
pins2lts-mc-linux64( 4/ 8), 0.558: ~2 levels ~3840 states ~10992 transitions
pins2lts-mc-linux64( 4/ 8), 0.817: ~2 levels ~7680 states ~27008 transitions
pins2lts-mc-linux64( 4/ 8), 2.484: ~2 levels ~15360 states ~352592 transitions
pins2lts-mc-linux64( 4/ 8), 5.953: ~2 levels ~30720 states ~1577216 transitions
pins2lts-mc-linux64( 4/ 8), 11.250: ~2 levels ~61440 states ~3861536 transitions
pins2lts-mc-linux64( 4/ 8), 21.177: ~2 levels ~122880 states ~8395880 transitions
pins2lts-mc-linux64( 1/ 8), 39.890: ~2 levels ~245760 states ~16866912 transitions
pins2lts-mc-linux64( 6/ 8), 76.031: ~2 levels ~491520 states ~32435592 transitions
pins2lts-mc-linux64( 1/ 8), 148.747: ~2 levels ~983040 states ~65045096 transitions
pins2lts-mc-linux64( 6/ 8), 286.698: ~2 levels ~1966080 states ~124120888 transitions
pins2lts-mc-linux64( 7/ 8), 469.251: ~187731 levels ~3932160 states ~188379880 transitions
pins2lts-mc-linux64( 7/ 8), 486.914: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 487.668:
pins2lts-mc-linux64( 0/ 8), 487.668: mean standard work distribution: 7.7% (states) 3.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 487.668:
pins2lts-mc-linux64( 0/ 8), 487.668: Explored 3454306 states 208562553 transitions, fanout: 60.378
pins2lts-mc-linux64( 0/ 8), 487.668: Total exploration time 487.300 sec (486.560 sec minimum, 486.721 sec on average)
pins2lts-mc-linux64( 0/ 8), 487.668: States per second: 7089, Transitions per second: 427996
pins2lts-mc-linux64( 0/ 8), 487.668:
pins2lts-mc-linux64( 0/ 8), 487.668: Progress states detected: 52257971
pins2lts-mc-linux64( 0/ 8), 487.668: Redundant explorations: -94.1027
pins2lts-mc-linux64( 0/ 8), 487.668:
pins2lts-mc-linux64( 0/ 8), 487.668: Queue width: 8B, total height: 73425100, memory: 560.19MB
pins2lts-mc-linux64( 0/ 8), 487.668: Tree memory: 702.9MB, 12.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 487.668: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 487.668: Stored 851 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 487.668: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 487.668: Est. total memory use: 1263.1MB (~1584.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4841393467420833517;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U X((X((LTLAPp2==true))&&<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4841393467420833517;'/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' '(((LTLAPp0==true) U (LTLAPp1==true)) U X((X((LTLAPp2==true))&&<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==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)
Detected timeout of ITS tools.
[2025-05-31 06:31:37] [INFO ] Applying decomposition
[2025-05-31 06:31:37] [INFO ] Flatten gal took : 287 ms
[2025-05-31 06:31:37] [INFO ] Decomposing Gal with order
[2025-05-31 06:31:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:31:38] [INFO ] Removed a total of 1690 redundant transitions.
[2025-05-31 06:31:38] [INFO ] Flatten gal took : 378 ms
[2025-05-31 06:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-05-31 06:31:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality8709880787062289721.gal : 22 ms
[2025-05-31 06:31:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality959545685606118519.ltl : 7 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/LTLCardinality8709880787062289721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality959545685606118519.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...296
Read 2 LTL properties
Checking formula 0 : !(((("((((((((gu82.RecBuff_4_8+gu90.RecBuff_7_10)+(gu30.RecBuff_6_8+gu65.RecBuff_3_9))+((gu42.RecBuff_7_4+gu66.RecBuff_9_3)+(gu45.RecB...8285
Formula 0 simplified : (!"((((((((gu82.RecBuff_4_8+gu90.RecBuff_7_10)+(gu30.RecBuff_6_8+gu65.RecBuff_3_9))+((gu42.RecBuff_7_4+gu66.RecBuff_9_3)+(gu45.RecBu...8271
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="DatabaseWithMutex-PT-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 DatabaseWithMutex-PT-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-174854029200843"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-10.tgz
mv DatabaseWithMutex-PT-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 ;