About the Execution of ITS-Tools for DLCshifumi-PT-2b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1641891.00 | 0.00 | 0.00 | FFFFFFFTFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067200300.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 DLCshifumi-PT-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067200300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 729K 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 DLCshifumi-PT-2b-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748690492717
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 11:21:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 11:21:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 11:21:34] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-05-31 11:21:34] [INFO ] Transformed 2483 places.
[2025-05-31 11:21:34] [INFO ] Transformed 3183 transitions.
[2025-05-31 11:21:34] [INFO ] Found NUPN structural information;
[2025-05-31 11:21:34] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 387 places :
Symmetric choice reduction at 0 with 387 rule applications. Total rules 387 place count 2096 transition count 2796
Iterating global reduction 0 with 387 rules applied. Total rules applied 774 place count 2096 transition count 2796
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 1077 place count 1793 transition count 2493
Iterating global reduction 0 with 303 rules applied. Total rules applied 1380 place count 1793 transition count 2493
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1382 place count 1793 transition count 2491
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 1489 place count 1686 transition count 2355
Iterating global reduction 1 with 107 rules applied. Total rules applied 1596 place count 1686 transition count 2355
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 1696 place count 1586 transition count 2255
Iterating global reduction 1 with 100 rules applied. Total rules applied 1796 place count 1586 transition count 2255
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1809 place count 1586 transition count 2242
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1851 place count 1544 transition count 2200
Iterating global reduction 2 with 42 rules applied. Total rules applied 1893 place count 1544 transition count 2200
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1935 place count 1502 transition count 2158
Iterating global reduction 2 with 42 rules applied. Total rules applied 1977 place count 1502 transition count 2158
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 2018 place count 1461 transition count 2117
Iterating global reduction 2 with 41 rules applied. Total rules applied 2059 place count 1461 transition count 2117
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2099 place count 1421 transition count 2077
Iterating global reduction 2 with 40 rules applied. Total rules applied 2139 place count 1421 transition count 2077
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 2164 place count 1396 transition count 2052
Iterating global reduction 2 with 25 rules applied. Total rules applied 2189 place count 1396 transition count 2052
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 2214 place count 1371 transition count 2027
Iterating global reduction 2 with 25 rules applied. Total rules applied 2239 place count 1371 transition count 2027
Applied a total of 2239 rules in 1112 ms. Remains 1371 /2483 variables (removed 1112) and now considering 2027/3183 (removed 1156) transitions.
// Phase 1: matrix 2027 rows 1371 cols
[2025-05-31 11:21:35] [INFO ] Computed 79 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:21:36] [INFO ] Implicit Places using invariants in 661 ms returned []
[2025-05-31 11:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:21:37] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Running 2026 sub problems to find dead transitions.
[2025-05-31 11:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1370/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 2026 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1371 constraints, PredecessorRefiner: 2026/2026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2026 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1370/3398 variables, and 0 constraints, problems are : Problem set: 0 solved, 2026 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1371 constraints, PredecessorRefiner: 0/2026 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 2026 unsolved
Search for dead transitions found 0 dead transitions in 60728ms
Starting structural reductions in LTL mode, iteration 1 : 1371/2483 places, 2027/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63547 ms. Remains : 1371/2483 places, 2027/3183 transitions.
Support contains 33 out of 1371 places after structural reductions.
[2025-05-31 11:22:38] [INFO ] Flatten gal took : 140 ms
[2025-05-31 11:22:38] [INFO ] Flatten gal took : 77 ms
[2025-05-31 11:22:38] [INFO ] Input system was already deterministic with 2027 transitions.
RANDOM walk for 40000 steps (8 resets) in 1598 ms. (25 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
[2025-05-31 11:22:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1235/1371 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2027/3398 variables, 1371/1450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3398 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3398/3398 variables, and 1450 constraints, problems are : Problem set: 0 solved, 1 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1371/1371 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1235/1371 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1371 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2027/3398 variables, 1371/1450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3398 variables, 1/1451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:22:40] [INFO ] Deduced a trap along path composed of 5 places in 126 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3398 variables, 1/1452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3398 variables, 0/1452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3398 variables, 0/1452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3398/3398 variables, and 1452 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1371/1371 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1894ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1822 steps, including 3 resets, run visited all 1 properties in 7 ms. (steps per millisecond=260 )
Parikh walk visited 1 properties in 12 ms.
Computed a total of 145 stabilizing places and 145 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' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1352 transition count 1993
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1352 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1352 transition count 1992
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1340 transition count 1979
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1340 transition count 1979
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 1334 transition count 1973
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 1334 transition count 1972
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 1330 transition count 1968
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 1330 transition count 1968
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 1327 transition count 1965
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 1327 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 1324 transition count 1962
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 1324 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1322 transition count 1960
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1322 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 1320 transition count 1958
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 1320 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 1318 transition count 1956
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 1318 transition count 1956
Applied a total of 108 rules in 285 ms. Remains 1318 /1371 variables (removed 53) and now considering 1956/2027 (removed 71) transitions.
// Phase 1: matrix 1956 rows 1318 cols
[2025-05-31 11:22:41] [INFO ] Computed 79 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:22:42] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-05-31 11:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:22:43] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
Running 1955 sub problems to find dead transitions.
[2025-05-31 11:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1317/3274 variables, and 0 constraints, problems are : Problem set: 0 solved, 1955 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1318 constraints, PredecessorRefiner: 1955/1955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1955 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1292 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/3274 variables, and 0 constraints, problems are : Problem set: 0 solved, 1955 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1318 constraints, PredecessorRefiner: 0/1955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60579ms problems are : Problem set: 0 solved, 1955 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Starting structural reductions in LTL mode, iteration 1 : 1318/1371 places, 1956/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62292 ms. Remains : 1318/1371 places, 1956/2027 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00
Stuttering criterion allowed to conclude after 50556 steps with 10 reset in 227 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 62823 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(X(G(X(F((X(!(!p0 U X(X(p0))))&&p1)))))))'
Support contains 3 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1352 transition count 1993
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1352 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1352 transition count 1992
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1340 transition count 1979
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1340 transition count 1979
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 1334 transition count 1973
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 1334 transition count 1972
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 1330 transition count 1968
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 1330 transition count 1968
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 1327 transition count 1965
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 1327 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 1324 transition count 1962
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 1324 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1322 transition count 1960
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1322 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1321 transition count 1959
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1321 transition count 1959
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1320 transition count 1958
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1320 transition count 1958
Applied a total of 104 rules in 301 ms. Remains 1320 /1371 variables (removed 51) and now considering 1958/2027 (removed 69) transitions.
// Phase 1: matrix 1958 rows 1320 cols
[2025-05-31 11:23:44] [INFO ] Computed 79 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:23:44] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-31 11:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:23:45] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Running 1957 sub problems to find dead transitions.
[2025-05-31 11:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1957/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1957 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 1957 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 1320/1371 places, 1958/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62163 ms. Remains : 1320/1371 places, 1958/2027 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-01
Product exploration explored 100000 steps with 16654 reset in 314 ms.
Product exploration explored 100000 steps with 16666 reset in 311 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
[2025-05-31 11:24:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1320 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1958/3278 variables, 1320/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3278 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3278 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3278/3278 variables, and 1399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1320/1320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1320 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:24:49] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1958/3278 variables, 1320/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3278 variables, 1/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3278 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3278 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3278/3278 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1320/1320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 38003 steps, including 85 resets, run visited all 1 properties in 136 ms. (steps per millisecond=279 )
Parikh walk visited 1 properties in 136 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1958/1958 transitions.
Applied a total of 0 rules in 41 ms. Remains 1320 /1320 variables (removed 0) and now considering 1958/1958 (removed 0) transitions.
[2025-05-31 11:24:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:24:51] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-05-31 11:24:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:24:52] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
Running 1957 sub problems to find dead transitions.
[2025-05-31 11:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1957/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1957 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 1957 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Finished structural reductions in LTL mode , in 1 iterations and 61916 ms. Remains : 1320/1320 places, 1958/1958 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2025-05-31 11:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1320 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1958/3278 variables, 1320/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3278 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3278 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3278/3278 variables, and 1399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1320/1320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 160/163 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1157/1320 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:25:54] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1958/3278 variables, 1320/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3278 variables, 1/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3278 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3278 variables, 0/1401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3278/3278 variables, and 1401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1320/1320 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14092 steps, including 31 resets, run visited all 1 properties in 46 ms. (steps per millisecond=306 )
Parikh walk visited 1 properties in 46 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 16717 reset in 218 ms.
Product exploration explored 100000 steps with 16573 reset in 213 ms.
Built C files in :
/tmp/ltsmin8636237337987642519
[2025-05-31 11:25:57] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8636237337987642519
Running compilation step : cd /tmp/ltsmin8636237337987642519;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8636237337987642519;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8636237337987642519;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1958/1958 transitions.
Applied a total of 0 rules in 40 ms. Remains 1320 /1320 variables (removed 0) and now considering 1958/1958 (removed 0) transitions.
[2025-05-31 11:26:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:26:00] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-05-31 11:26:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:26:01] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 1957 sub problems to find dead transitions.
[2025-05-31 11:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1957/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1957 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/3278 variables, and 0 constraints, problems are : Problem set: 0 solved, 1957 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1957 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60444ms problems are : Problem set: 0 solved, 1957 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Finished structural reductions in LTL mode , in 1 iterations and 61824 ms. Remains : 1320/1320 places, 1958/1958 transitions.
Built C files in :
/tmp/ltsmin6073058075019464311
[2025-05-31 11:27:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6073058075019464311
Running compilation step : cd /tmp/ltsmin6073058075019464311;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6073058075019464311;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6073058075019464311;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 11:27:05] [INFO ] Flatten gal took : 65 ms
[2025-05-31 11:27:05] [INFO ] Flatten gal took : 55 ms
[2025-05-31 11:27:05] [INFO ] Time to serialize gal into /tmp/LTL15259614482030716486.gal : 28 ms
[2025-05-31 11:27:05] [INFO ] Time to serialize properties into /tmp/LTL2831659610457569055.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15259614482030716486.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3180730846466208941.hoa' '-atoms' '/tmp/LTL2831659610457569055.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2831659610457569055.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3180730846466208941.hoa
Detected timeout of ITS tools.
[2025-05-31 11:27:20] [INFO ] Flatten gal took : 50 ms
[2025-05-31 11:27:20] [INFO ] Flatten gal took : 57 ms
[2025-05-31 11:27:20] [INFO ] Time to serialize gal into /tmp/LTL5391523895878112412.gal : 9 ms
[2025-05-31 11:27:20] [INFO ] Time to serialize properties into /tmp/LTL11358800675710145902.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/LTL5391523895878112412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11358800675710145902.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 : !((G(X(G(X(F((X(!((!("((p1706==1)&&(p2406==1))"))U(X(X("((p1706==1)&&(p2406==1))"))))))&&("(p367==0)"))))))))
Formula 0 simplified : FG(!"(p367==0)" | X(!"((p1706==1)&&(p2406==1))" U XX"((p1706==1)&&(p2406==1))"))
Detected timeout of ITS tools.
[2025-05-31 11:27:35] [INFO ] Flatten gal took : 42 ms
[2025-05-31 11:27:35] [INFO ] Applying decomposition
[2025-05-31 11:27:35] [INFO ] Flatten gal took : 44 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/graph2566047959320467211.txt' '-o' '/tmp/graph2566047959320467211.bin' '-w' '/tmp/graph2566047959320467211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2566047959320467211.bin' '-l' '-1' '-v' '-w' '/tmp/graph2566047959320467211.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:27:36] [INFO ] Decomposing Gal with order
[2025-05-31 11:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:27:36] [INFO ] Removed a total of 1445 redundant transitions.
[2025-05-31 11:27:36] [INFO ] Flatten gal took : 154 ms
[2025-05-31 11:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 50 ms.
[2025-05-31 11:27:36] [INFO ] Time to serialize gal into /tmp/LTL4756681988104050750.gal : 20 ms
[2025-05-31 11:27:36] [INFO ] Time to serialize properties into /tmp/LTL16495564298198517446.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4756681988104050750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16495564298198517446.ltl' '-c' '-stutter-deadlock'
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...255
Read 1 LTL properties
Checking formula 0 : !((G(X(G(X(F((X(!((!("((i19.u329.p1706==1)&&(i13.i1.i1.u482.p2406==1))"))U(X(X("((i19.u329.p1706==1)&&(i13.i1.i1.u482.p2406==1))")))))...191
Formula 0 simplified : FG(!"(i4.i1.i0.u74.p367==0)" | X(!"((i19.u329.p1706==1)&&(i13.i1.i1.u482.p2406==1))" U XX"((i19.u329.p1706==1)&&(i13.i1.i1.u482.p240...164
Detected timeout of ITS tools.
Treatment of property DLCshifumi-PT-2b-LTLFireability-01 finished in 247445 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))||(F(p1)&&G(p2))))'
Support contains 4 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1353 transition count 1994
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1353 transition count 1994
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1341 transition count 1981
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1341 transition count 1981
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 1335 transition count 1975
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 1335 transition count 1975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1335 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 1330 transition count 1969
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 1330 transition count 1969
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 1326 transition count 1965
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 1326 transition count 1965
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 1322 transition count 1961
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 1322 transition count 1961
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 1319 transition count 1958
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 1319 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 1317 transition count 1956
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 1317 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 1315 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 1315 transition count 1954
Applied a total of 113 rules in 374 ms. Remains 1315 /1371 variables (removed 56) and now considering 1954/2027 (removed 73) transitions.
// Phase 1: matrix 1954 rows 1315 cols
[2025-05-31 11:27:52] [INFO ] Computed 79 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:27:52] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-05-31 11:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:27:53] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2025-05-31 11:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/3269 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/3269 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1315 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in LTL mode, iteration 1 : 1315/1371 places, 1954/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62155 ms. Remains : 1315/1371 places, 1954/2027 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-02
Stuttering criterion allowed to conclude after 9838 steps with 2 reset in 31 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-02 finished in 62415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&F(p1)))&&F(p2))))'
Support contains 3 out of 1371 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Graph (trivial) has 1304 edges and 1371 vertex of which 328 / 1371 are part of one of the 23 SCC in 7 ms
Free SCC test removed 305 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 311 place count 1065 transition count 1375
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 363 rules applied. Total rules applied 674 place count 755 transition count 1322
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 709 place count 720 transition count 1322
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 709 place count 720 transition count 1217
Deduced a syphon composed of 105 places in 2 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 919 place count 615 transition count 1217
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 973 place count 561 transition count 1013
Iterating global reduction 3 with 54 rules applied. Total rules applied 1027 place count 561 transition count 1013
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1042 place count 561 transition count 998
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1042 place count 561 transition count 992
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1054 place count 555 transition count 992
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1055 place count 554 transition count 990
Iterating global reduction 4 with 1 rules applied. Total rules applied 1056 place count 554 transition count 990
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1057 place count 554 transition count 989
Performed 188 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 5 with 376 rules applied. Total rules applied 1433 place count 366 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1435 place count 366 transition count 797
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1453 place count 348 transition count 705
Iterating global reduction 6 with 18 rules applied. Total rules applied 1471 place count 348 transition count 705
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1489 place count 348 transition count 687
Performed 52 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 1593 place count 296 transition count 766
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1607 place count 282 transition count 704
Iterating global reduction 7 with 14 rules applied. Total rules applied 1621 place count 282 transition count 704
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1650 place count 282 transition count 675
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 1671 place count 282 transition count 654
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1675 place count 278 transition count 646
Iterating global reduction 8 with 4 rules applied. Total rules applied 1679 place count 278 transition count 646
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1683 place count 274 transition count 576
Iterating global reduction 8 with 4 rules applied. Total rules applied 1687 place count 274 transition count 576
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1691 place count 274 transition count 572
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1692 place count 273 transition count 571
Applied a total of 1692 rules in 275 ms. Remains 273 /1371 variables (removed 1098) and now considering 571/2027 (removed 1456) transitions.
[2025-05-31 11:28:54] [INFO ] Flow matrix only has 543 transitions (discarded 28 similar events)
// Phase 1: matrix 543 rows 273 cols
[2025-05-31 11:28:54] [INFO ] Computed 79 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:28:54] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-31 11:28:54] [INFO ] Flow matrix only has 543 transitions (discarded 28 similar events)
[2025-05-31 11:28:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:28:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 11:28:54] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:28:54] [INFO ] Redundant transitions in 39 ms returned []
Running 501 sub problems to find dead transitions.
[2025-05-31 11:28:54] [INFO ] Flow matrix only has 543 transitions (discarded 28 similar events)
[2025-05-31 11:28:54] [INFO ] Invariant cache hit.
[2025-05-31 11:28:54] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:03] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:03] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 542/815 variables, 273/354 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 45/399 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/816 variables, and 399 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 273/273 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 62/81 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 542/815 variables, 273/354 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 45/399 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 501/900 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 2 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 11:29:51] [INFO ] Deduced a trap along path composed of 3 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 11:29:51] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 3 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 11:29:51] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:51] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 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 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:29:52] [INFO ] Deduced a trap along path composed of 3 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 11:29:52] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/815 variables, 20/920 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/816 variables, and 920 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 273/273 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/1371 places, 571/2027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60901 ms. Remains : 273/1371 places, 571/2027 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-04 finished in 61118 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((X(X(X(F(p0))))||(!p0 U (p1||G(!p0))))))))'
Support contains 2 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1352 transition count 1993
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1352 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1352 transition count 1992
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1340 transition count 1979
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1340 transition count 1979
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 1333 transition count 1972
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 1328 transition count 1966
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 1328 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 1324 transition count 1962
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 1324 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 1320 transition count 1958
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 1320 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 1317 transition count 1955
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 1315 transition count 1953
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 1313 transition count 1951
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 1313 transition count 1951
Applied a total of 118 rules in 348 ms. Remains 1313 /1371 variables (removed 58) and now considering 1951/2027 (removed 76) transitions.
// Phase 1: matrix 1951 rows 1313 cols
[2025-05-31 11:29:55] [INFO ] Computed 79 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:29:55] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-05-31 11:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:29:56] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Running 1950 sub problems to find dead transitions.
[2025-05-31 11:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 1950/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1950 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 0/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 1950 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Starting structural reductions in LTL mode, iteration 1 : 1313/1371 places, 1951/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62273 ms. Remains : 1313/1371 places, 1951/2027 transitions.
Stuttering acceptance computed with spot in 353 ms :[false, false, false, (NOT p0), false, (NOT p0), (NOT p0), false]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-05
Stuttering criterion allowed to conclude after 6882 steps with 2 reset in 24 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-05 finished in 62681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1371 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Graph (trivial) has 1305 edges and 1371 vertex of which 328 / 1371 are part of one of the 23 SCC in 3 ms
Free SCC test removed 305 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 311 place count 1065 transition count 1375
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 365 rules applied. Total rules applied 676 place count 755 transition count 1320
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 714 place count 719 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 715 place count 718 transition count 1318
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 715 place count 718 transition count 1213
Deduced a syphon composed of 105 places in 2 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 925 place count 613 transition count 1213
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 978 place count 560 transition count 1010
Iterating global reduction 4 with 53 rules applied. Total rules applied 1031 place count 560 transition count 1010
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1046 place count 560 transition count 995
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1046 place count 560 transition count 990
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1056 place count 555 transition count 990
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1057 place count 554 transition count 988
Iterating global reduction 5 with 1 rules applied. Total rules applied 1058 place count 554 transition count 988
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1059 place count 554 transition count 987
Performed 191 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 6 with 382 rules applied. Total rules applied 1441 place count 363 transition count 794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1443 place count 363 transition count 792
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1461 place count 345 transition count 700
Iterating global reduction 7 with 18 rules applied. Total rules applied 1479 place count 345 transition count 700
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1497 place count 345 transition count 682
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 1595 place count 296 transition count 747
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1610 place count 281 transition count 683
Iterating global reduction 8 with 15 rules applied. Total rules applied 1625 place count 281 transition count 683
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1656 place count 281 transition count 652
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1669 place count 281 transition count 639
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1673 place count 277 transition count 631
Iterating global reduction 9 with 4 rules applied. Total rules applied 1677 place count 277 transition count 631
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1681 place count 273 transition count 563
Iterating global reduction 9 with 4 rules applied. Total rules applied 1685 place count 273 transition count 563
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1689 place count 273 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1690 place count 272 transition count 558
Applied a total of 1690 rules in 165 ms. Remains 272 /1371 variables (removed 1099) and now considering 558/2027 (removed 1469) transitions.
[2025-05-31 11:30:57] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
// Phase 1: matrix 535 rows 272 cols
[2025-05-31 11:30:58] [INFO ] Computed 79 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:30:58] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-31 11:30:58] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2025-05-31 11:30:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:30:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 11:30:58] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:30:58] [INFO ] Redundant transitions in 11 ms returned []
Running 474 sub problems to find dead transitions.
[2025-05-31 11:30:58] [INFO ] Flow matrix only has 535 transitions (discarded 23 similar events)
[2025-05-31 11:30:58] [INFO ] Invariant cache hit.
[2025-05-31 11:30:58] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 534/806 variables, 272/351 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 40/391 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/807 variables, and 391 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 272/272 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 534/806 variables, 272/351 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 40/391 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 474/865 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/807 variables, and 865 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 272/272 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 272/1371 places, 558/2027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60736 ms. Remains : 272/1371 places, 558/2027 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-06
Stuttering criterion allowed to conclude after 2735 steps with 2 reset in 24 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-06 finished in 60860 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) U p1) U X(X((!p1&&X((!p1 U (p2||G(!p1)))))))))'
Support contains 4 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1353 transition count 1994
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1353 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1353 transition count 1993
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1341 transition count 1980
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1341 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 1334 transition count 1973
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 1334 transition count 1972
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 1329 transition count 1967
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 1329 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 1325 transition count 1963
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 1325 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 1321 transition count 1959
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 1321 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 1318 transition count 1956
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 1316 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1314 transition count 1952
Applied a total of 116 rules in 339 ms. Remains 1314 /1371 variables (removed 57) and now considering 1952/2027 (removed 75) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2025-05-31 11:31:59] [INFO ] Computed 79 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:31:59] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-31 11:31:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:32:00] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:32:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 1314/1371 places, 1952/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62115 ms. Remains : 1314/1371 places, 1952/2027 transitions.
Stuttering acceptance computed with spot in 379 ms :[p1, (AND (NOT p0) p1), false, p1, (AND (NOT p0) p1), false, p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-07
Product exploration explored 100000 steps with 36401 reset in 333 ms.
Product exploration explored 100000 steps with 36483 reset in 346 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 381 ms. (104 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
[2025-05-31 11:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1314 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3266/3266 variables, and 1393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1314 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 4/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3266 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3266/3266 variables, and 1397 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3501ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5531 steps, including 9 resets, run visited all 4 properties in 51 ms. (steps per millisecond=108 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 52 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 401 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 304 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Applied a total of 0 rules in 36 ms. Remains 1314 /1314 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2025-05-31 11:33:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:33:07] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-31 11:33:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:33:08] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:33:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 timeout
1.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in LTL mode , in 1 iterations and 61862 ms. Remains : 1314/1314 places, 1952/1952 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
[2025-05-31 11:34:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1314 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3266 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3266/3266 variables, and 1393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1314 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3266 variables, 1314/1393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3266 variables, 4/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3266 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3266/3266 variables, and 1397 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3244ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 568 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=51 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 10 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 348 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 295 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Product exploration explored 100000 steps with 25000 reset in 233 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 293 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1244 edges and 1314 vertex of which 319 / 1314 are part of one of the 23 SCC in 1 ms
Free SCC test removed 296 places
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1018 transition count 1620
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 32 rules applied. Total rules applied 312 place count 1018 transition count 1604
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 312 place count 1018 transition count 1620
Deduced a syphon composed of 325 places in 3 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 342 place count 1018 transition count 1620
Discarding 183 places :
Symmetric choice reduction at 2 with 183 rule applications. Total rules 525 place count 835 transition count 1317
Deduced a syphon composed of 183 places in 1 ms
Iterating global reduction 2 with 183 rules applied. Total rules applied 708 place count 835 transition count 1317
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 723 place count 835 transition count 1302
Performed 284 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 467 places in 0 ms
Iterating global reduction 3 with 284 rules applied. Total rules applied 1007 place count 835 transition count 1304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1009 place count 835 transition count 1302
Renaming transitions due to excessive name length > 1024 char.
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 1264 place count 580 transition count 972
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 4 with 255 rules applied. Total rules applied 1519 place count 580 transition count 972
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1538 place count 580 transition count 953
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1540 place count 578 transition count 951
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1542 place count 578 transition count 951
Performed 52 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 5 with 52 rules applied. Total rules applied 1594 place count 578 transition count 1217
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 1626 place count 578 transition count 1185
Discarding 69 places :
Symmetric choice reduction at 6 with 69 rule applications. Total rules 1695 place count 509 transition count 998
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 6 with 69 rules applied. Total rules applied 1764 place count 509 transition count 998
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 1809 place count 509 transition count 953
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 1839 place count 479 transition count 893
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 30 rules applied. Total rules applied 1869 place count 479 transition count 893
Deduced a syphon composed of 197 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 1887 place count 479 transition count 875
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1890 place count 476 transition count 869
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1893 place count 476 transition count 869
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1896 place count 473 transition count 818
Deduced a syphon composed of 197 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1899 place count 473 transition count 818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1903 place count 473 transition count 814
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1906 place count 470 transition count 810
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1909 place count 470 transition count 810
Deduced a syphon composed of 194 places in 1 ms
Applied a total of 1909 rules in 388 ms. Remains 470 /1314 variables (removed 844) and now considering 810/1952 (removed 1142) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:34:15] [INFO ] Redundant transitions in 8 ms returned []
Running 809 sub problems to find dead transitions.
[2025-05-31 11:34:15] [INFO ] Flow matrix only has 789 transitions (discarded 21 similar events)
// Phase 1: matrix 789 rows 470 cols
[2025-05-31 11:34:15] [INFO ] Computed 79 invariants in 8 ms
[2025-05-31 11:34:15] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (OVERLAPS) 1/470 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 809 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:30] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:31] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:31] [INFO ] Deduced a trap composed of 4 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 11:34:31] [INFO ] Deduced a trap composed of 6 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 11:34:32] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 4 ms to minimize.
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 23 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 11:34:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 25 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 11:34:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 20/99 constraints. Problems are: Problem set: 167 solved, 642 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:34] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD215 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:34] [INFO ] Deduced a trap composed of 4 places in 35 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 11:34:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD276 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD289 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD294 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 37 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 11:34:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD328 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD341 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD346 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD354 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD359 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD367 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 20/119 constraints. Problems are: Problem set: 190 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD385 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD393 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD409 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 35 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 11:34:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD422 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD430 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD435 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD443 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD448 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD454 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD459 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD465 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD470 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD476 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD481 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD487 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD492 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/139 constraints. Problems are: Problem set: 210 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1259 variables, and 139 constraints, problems are : Problem set: 210 solved, 599 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 0/470 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 809/809 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 210 solved, 599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 210 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 176/470 variables, 79/79 constraints. Problems are: Problem set: 210 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 60/139 constraints. Problems are: Problem set: 210 solved, 599 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD503 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD509 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD514 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD520 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD525 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD531 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD536 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD542 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD547 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD553 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 24 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 11:34:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD564 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD569 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:52] [INFO ] Deduced a trap composed of 4 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 11:34:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD580 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD591 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD595 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:34:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 19/158 constraints. Problems are: Problem set: 231 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/158 constraints. Problems are: Problem set: 231 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 788/1258 variables, 470/628 constraints. Problems are: Problem set: 231 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1258 variables, 100/728 constraints. Problems are: Problem set: 231 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1258 variables, 578/1306 constraints. Problems are: Problem set: 231 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1259 variables, and 1306 constraints, problems are : Problem set: 231 solved, 578 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 470/470 constraints, ReadFeed: 100/101 constraints, PredecessorRefiner: 578/809 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 231 solved, 578 unsolved
Search for dead transitions found 231 dead transitions in 60354ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 470/1314 places, 579/1952 transitions.
Graph (complete) has 1059 edges and 470 vertex of which 276 are kept as prefixes of interest. Removing 194 places using SCC suffix rule.1 ms
Discarding 194 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 276 transition count 617
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 29 place count 276 transition count 593
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 276 transition count 634
Deduced a syphon composed of 8 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 58 place count 276 transition count 609
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 276 transition count 650
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 87 place count 276 transition count 625
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 91 place count 276 transition count 666
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 116 place count 276 transition count 641
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 276 transition count 682
Deduced a syphon composed of 20 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 145 place count 276 transition count 657
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 149 place count 276 transition count 698
Deduced a syphon composed of 24 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 171 place count 276 transition count 676
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 174 place count 276 transition count 708
Deduced a syphon composed of 27 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 190 place count 276 transition count 692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 192 place count 276 transition count 717
Deduced a syphon composed of 29 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 209 place count 276 transition count 700
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 211 place count 276 transition count 723
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 228 place count 276 transition count 706
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 230 place count 276 transition count 729
Deduced a syphon composed of 33 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 247 place count 276 transition count 712
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 249 place count 276 transition count 735
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 266 place count 276 transition count 718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 268 place count 276 transition count 741
Deduced a syphon composed of 37 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 285 place count 276 transition count 724
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 276 transition count 747
Deduced a syphon composed of 39 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 304 place count 276 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 306 place count 276 transition count 753
Deduced a syphon composed of 41 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 323 place count 276 transition count 736
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 325 place count 276 transition count 759
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 342 place count 276 transition count 742
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 344 place count 276 transition count 765
Deduced a syphon composed of 45 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 361 place count 276 transition count 748
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 363 place count 276 transition count 771
Deduced a syphon composed of 47 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 380 place count 276 transition count 754
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 382 place count 276 transition count 777
Deduced a syphon composed of 49 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 399 place count 276 transition count 760
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 401 place count 276 transition count 783
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 418 place count 276 transition count 766
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 420 place count 276 transition count 789
Deduced a syphon composed of 53 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 437 place count 276 transition count 772
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 439 place count 276 transition count 795
Deduced a syphon composed of 55 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 449 place count 276 transition count 785
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 450 place count 276 transition count 799
Deduced a syphon composed of 56 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 461 place count 276 transition count 788
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 462 place count 276 transition count 801
Deduced a syphon composed of 57 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 472 place count 276 transition count 791
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 473 place count 276 transition count 805
Deduced a syphon composed of 58 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 484 place count 276 transition count 794
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 484 rules in 467 ms. Remains 276 /470 variables (removed 194) and now considering 794/579 (removed -215) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 276/1314 places, 794/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61229 ms. Remains : 276/1314 places, 794/1952 transitions.
Built C files in :
/tmp/ltsmin4665024852053869137
[2025-05-31 11:35:16] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4665024852053869137
Running compilation step : cd /tmp/ltsmin4665024852053869137;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4665024852053869137;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4665024852053869137;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Applied a total of 0 rules in 35 ms. Remains 1314 /1314 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2025-05-31 11:35:19] [INFO ] Computed 79 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:35:19] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-05-31 11:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:35:20] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Finished structural reductions in LTL mode , in 1 iterations and 61807 ms. Remains : 1314/1314 places, 1952/1952 transitions.
Built C files in :
/tmp/ltsmin7534579754163546893
[2025-05-31 11:36:21] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7534579754163546893
Running compilation step : cd /tmp/ltsmin7534579754163546893;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7534579754163546893;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7534579754163546893;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 11:36:24] [INFO ] Flatten gal took : 41 ms
[2025-05-31 11:36:24] [INFO ] Flatten gal took : 37 ms
[2025-05-31 11:36:24] [INFO ] Time to serialize gal into /tmp/LTL18271657047773424780.gal : 8 ms
[2025-05-31 11:36:24] [INFO ] Time to serialize properties into /tmp/LTL17480328709490033723.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18271657047773424780.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4917461211932612229.hoa' '-atoms' '/tmp/LTL17480328709490033723.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/LTL17480328709490033723.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4917461211932612229.hoa
Detected timeout of ITS tools.
[2025-05-31 11:36:39] [INFO ] Flatten gal took : 33 ms
[2025-05-31 11:36:39] [INFO ] Flatten gal took : 34 ms
[2025-05-31 11:36:39] [INFO ] Time to serialize gal into /tmp/LTL10964016458520087715.gal : 7 ms
[2025-05-31 11:36:39] [INFO ] Time to serialize properties into /tmp/LTL17386891266003071786.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/LTL10964016458520087715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17386891266003071786.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 : !((((F("(p2094!=1)"))U("((p1592==1)&&(p2159==1))"))U(X(X((!("((p1592==1)&&(p2159==1))"))&&(X((!("((p1592==1)&&(p2159==1))"))U(("(p1329...205
Formula 0 simplified : (G!"(p2094!=1)" R !"((p1592==1)&&(p2159==1))") R XX("((p1592==1)&&(p2159==1))" | X("((p1592==1)&&(p2159==1))" M !"(p1329!=1)"))
Detected timeout of ITS tools.
[2025-05-31 11:36:54] [INFO ] Flatten gal took : 35 ms
[2025-05-31 11:36:54] [INFO ] Applying decomposition
[2025-05-31 11:36:54] [INFO ] Flatten gal took : 34 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/graph10676644853891762803.txt' '-o' '/tmp/graph10676644853891762803.bin' '-w' '/tmp/graph10676644853891762803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10676644853891762803.bin' '-l' '-1' '-v' '-w' '/tmp/graph10676644853891762803.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:36:54] [INFO ] Decomposing Gal with order
[2025-05-31 11:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:36:54] [INFO ] Removed a total of 1419 redundant transitions.
[2025-05-31 11:36:54] [INFO ] Flatten gal took : 85 ms
[2025-05-31 11:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 14 ms.
[2025-05-31 11:36:54] [INFO ] Time to serialize gal into /tmp/LTL2099200297801286474.gal : 15 ms
[2025-05-31 11:36:54] [INFO ] Time to serialize properties into /tmp/LTL6268493011086195707.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2099200297801286474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6268493011086195707.ltl' '-c' '-stutter-deadlock'
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...254
Read 1 LTL properties
Checking formula 0 : !((((F("(i15.u423.p2094!=1)"))U("((i15.u301.p1592==1)&&(i15.u433.p2159==1))"))U(X(X((!("((i15.u301.p1592==1)&&(i15.u433.p2159==1))"))&...301
Formula 0 simplified : (G!"(i15.u423.p2094!=1)" R !"((i15.u301.p1592==1)&&(i15.u433.p2159==1))") R XX("((i15.u301.p1592==1)&&(i15.u433.p2159==1))" | X("((i...228
Detected timeout of ITS tools.
Treatment of property DLCshifumi-PT-2b-LTLFireability-07 finished in 311298 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(((F(p0) U p1) U p2))) U ((!p2&&X(X(((F(p0) U p1) U p2))))||X(X(G(((F(p0) U p1) U p2)))))))'
Support contains 3 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1353 transition count 1994
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1353 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1353 transition count 1993
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 1341 transition count 1980
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 1341 transition count 1980
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 1334 transition count 1973
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 1334 transition count 1973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 1334 transition count 1972
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 1329 transition count 1967
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 1329 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 1325 transition count 1963
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 1325 transition count 1963
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 1321 transition count 1959
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 1321 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 1318 transition count 1956
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 1316 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1314 transition count 1952
Applied a total of 116 rules in 345 ms. Remains 1314 /1371 variables (removed 57) and now considering 1952/2027 (removed 75) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2025-05-31 11:37:10] [INFO ] Computed 79 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:37:10] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-05-31 11:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:37:11] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:37:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Starting structural reductions in LTL mode, iteration 1 : 1314/1371 places, 1952/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62128 ms. Remains : 1314/1371 places, 1952/2027 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-09
Product exploration explored 100000 steps with 246 reset in 247 ms.
Product exploration explored 100000 steps with 241 reset in 273 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 25293 steps (5 resets) in 129 ms. (194 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
[2025-05-31 11:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:38:14] [INFO ] [Real]Absence check using 79 positive place invariants in 202 ms returned sat
[2025-05-31 11:38:21] [INFO ] [Real]Absence check using state equation in 6334 ms returned sat
[2025-05-31 11:38:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:38:21] [INFO ] [Nat]Absence check using 79 positive place invariants in 213 ms returned sat
[2025-05-31 11:38:28] [INFO ] [Nat]Absence check using state equation in 7018 ms returned sat
[2025-05-31 11:38:29] [INFO ] Computed and/alt/rep : 1893/3091/1893 causal constraints (skipped 58 transitions) in 83 ms.
Could not prove EG (NOT p2)
Support contains 3 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Applied a total of 0 rules in 30 ms. Remains 1314 /1314 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2025-05-31 11:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:38:36] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-05-31 11:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:38:37] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)timeout
(s675 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in LTL mode , in 1 iterations and 61791 ms. Remains : 1314/1314 places, 1952/1952 transitions.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 25808 steps (5 resets) in 111 ms. (230 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
[2025-05-31 11:39:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:39:39] [INFO ] [Real]Absence check using 79 positive place invariants in 198 ms returned sat
[2025-05-31 11:39:45] [INFO ] [Real]Absence check using state equation in 6203 ms returned sat
[2025-05-31 11:39:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:39:46] [INFO ] [Nat]Absence check using 79 positive place invariants in 204 ms returned sat
[2025-05-31 11:39:53] [INFO ] [Nat]Absence check using state equation in 6674 ms returned sat
[2025-05-31 11:39:53] [INFO ] Computed and/alt/rep : 1893/3091/1893 causal constraints (skipped 58 transitions) in 82 ms.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 243 reset in 262 ms.
Product exploration explored 100000 steps with 239 reset in 276 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Support contains 3 out of 1314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Graph (trivial) has 1242 edges and 1314 vertex of which 304 / 1314 are part of one of the 22 SCC in 2 ms
Free SCC test removed 282 places
Ensure Unique test removed 316 transitions
Reduce isomorphic transitions removed 316 transitions.
Performed 285 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 285 rules applied. Total rules applied 286 place count 1032 transition count 1636
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 34 rules applied. Total rules applied 320 place count 1032 transition count 1619
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 320 place count 1032 transition count 1635
Deduced a syphon composed of 333 places in 2 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 351 place count 1032 transition count 1635
Discarding 188 places :
Symmetric choice reduction at 2 with 188 rule applications. Total rules 539 place count 844 transition count 1313
Deduced a syphon composed of 185 places in 2 ms
Iterating global reduction 2 with 188 rules applied. Total rules applied 727 place count 844 transition count 1313
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 741 place count 844 transition count 1299
Performed 288 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 473 places in 0 ms
Iterating global reduction 3 with 288 rules applied. Total rules applied 1029 place count 844 transition count 1302
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1032 place count 844 transition count 1299
Renaming transitions due to excessive name length > 1024 char.
Discarding 257 places :
Symmetric choice reduction at 4 with 257 rule applications. Total rules 1289 place count 587 transition count 967
Deduced a syphon composed of 235 places in 0 ms
Iterating global reduction 4 with 257 rules applied. Total rules applied 1546 place count 587 transition count 967
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1565 place count 587 transition count 948
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1567 place count 585 transition count 946
Deduced a syphon composed of 233 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1569 place count 585 transition count 946
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1570 place count 585 transition count 946
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1572 place count 583 transition count 944
Deduced a syphon composed of 232 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1574 place count 583 transition count 944
Performed 54 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 1628 place count 583 transition count 1217
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 1662 place count 583 transition count 1183
Discarding 72 places :
Symmetric choice reduction at 6 with 72 rule applications. Total rules 1734 place count 511 transition count 989
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 6 with 72 rules applied. Total rules applied 1806 place count 511 transition count 989
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 1848 place count 511 transition count 947
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1877 place count 482 transition count 889
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 7 with 29 rules applied. Total rules applied 1906 place count 482 transition count 889
Deduced a syphon composed of 200 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 1925 place count 482 transition count 870
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1929 place count 478 transition count 862
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1933 place count 478 transition count 862
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1937 place count 474 transition count 794
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1941 place count 474 transition count 794
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1947 place count 474 transition count 788
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1951 place count 470 transition count 782
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1955 place count 470 transition count 782
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 1955 rules in 250 ms. Remains 470 /1314 variables (removed 844) and now considering 782/1952 (removed 1170) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:40:02] [INFO ] Redundant transitions in 10 ms returned []
Running 781 sub problems to find dead transitions.
[2025-05-31 11:40:02] [INFO ] Flow matrix only has 763 transitions (discarded 19 similar events)
// Phase 1: matrix 763 rows 470 cols
[2025-05-31 11:40:02] [INFO ] Computed 79 invariants in 7 ms
[2025-05-31 11:40:02] [INFO ] State equation strengthened by 99 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/470 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:17] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:17] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 22 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 11:40:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:18] [INFO ] Deduced a trap composed of 6 places in 26 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 11:40:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:19] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:19] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:19] [INFO ] Deduced a trap composed of 6 places in 21 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 11:40:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 20/99 constraints. Problems are: Problem set: 174 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:20] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD270 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD276 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD281 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD287 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 33 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 11:40:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD303 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD309 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 32 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 11:40:21] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD336 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD348 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:21] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 20/119 constraints. Problems are: Problem set: 195 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD359 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD365 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD370 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD380 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD386 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD391 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 34 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 11:40:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD402 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD408 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD423 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD429 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD434 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD440 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD445 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD451 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD456 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD462 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD359 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD467 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/139 constraints. Problems are: Problem set: 215 solved, 566 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD473 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD478 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD484 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD489 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD495 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:31] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD500 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD506 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD512 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD518 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD523 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD529 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD534 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD540 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD545 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD551 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD556 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1233 variables, and 155 constraints, problems are : Problem set: 231 solved, 550 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 0/470 constraints, ReadFeed: 0/99 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 231 solved, 550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 231 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 194/470 variables, 79/79 constraints. Problems are: Problem set: 231 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 76/155 constraints. Problems are: Problem set: 231 solved, 550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD560 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:40:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 3/158 constraints. Problems are: Problem set: 236 solved, 545 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/158 constraints. Problems are: Problem set: 236 solved, 545 unsolved
At refinement iteration 5 (OVERLAPS) 762/1232 variables, 470/628 constraints. Problems are: Problem set: 236 solved, 545 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 98/726 constraints. Problems are: Problem set: 236 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 545/1271 constraints. Problems are: Problem set: 236 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1232/1233 variables, and 1271 constraints, problems are : Problem set: 236 solved, 545 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 470/470 constraints, ReadFeed: 98/99 constraints, PredecessorRefiner: 545/781 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 236 solved, 545 unsolved
Search for dead transitions found 236 dead transitions in 60382ms
Found 236 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 236 transitions
Dead transitions reduction (with SMT) removed 236 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 470/1314 places, 546/1952 transitions.
Graph (complete) has 1009 edges and 470 vertex of which 274 are kept as prefixes of interest. Removing 196 places using SCC suffix rule.0 ms
Discarding 196 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 274 transition count 583
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 27 place count 274 transition count 561
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 274 transition count 591
Deduced a syphon composed of 7 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 51 place count 274 transition count 570
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 274 transition count 601
Deduced a syphon composed of 10 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 76 place count 274 transition count 579
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 274 transition count 609
Deduced a syphon composed of 13 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 100 place count 274 transition count 588
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 274 transition count 619
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 125 place count 274 transition count 597
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 274 transition count 628
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 149 place count 274 transition count 607
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 274 transition count 639
Deduced a syphon composed of 22 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 174 place count 274 transition count 617
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 177 place count 274 transition count 645
Deduced a syphon composed of 25 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 198 place count 274 transition count 624
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 201 place count 274 transition count 655
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 223 place count 274 transition count 633
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 274 transition count 663
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 247 place count 274 transition count 642
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 250 place count 274 transition count 673
Deduced a syphon composed of 34 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 268 place count 274 transition count 655
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 270 place count 274 transition count 678
Deduced a syphon composed of 36 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 287 place count 274 transition count 661
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 289 place count 274 transition count 684
Deduced a syphon composed of 38 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 306 place count 274 transition count 667
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 308 place count 274 transition count 690
Deduced a syphon composed of 40 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 325 place count 274 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 327 place count 274 transition count 696
Deduced a syphon composed of 42 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 344 place count 274 transition count 679
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 346 place count 274 transition count 702
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 363 place count 274 transition count 685
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 365 place count 274 transition count 708
Deduced a syphon composed of 46 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 382 place count 274 transition count 691
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 384 place count 274 transition count 714
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 401 place count 274 transition count 697
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 403 place count 274 transition count 722
Deduced a syphon composed of 50 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 420 place count 274 transition count 705
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 422 place count 274 transition count 728
Deduced a syphon composed of 52 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 439 place count 274 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 441 place count 274 transition count 734
Deduced a syphon composed of 54 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 458 place count 274 transition count 717
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 460 place count 274 transition count 740
Deduced a syphon composed of 56 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 477 place count 274 transition count 723
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 479 place count 274 transition count 746
Deduced a syphon composed of 58 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 496 place count 274 transition count 729
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 497 place count 274 transition count 739
Deduced a syphon composed of 59 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 504 place count 274 transition count 732
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 504 rules in 315 ms. Remains 274 /470 variables (removed 196) and now considering 732/546 (removed -186) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 274/1314 places, 732/1952 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60967 ms. Remains : 274/1314 places, 732/1952 transitions.
Built C files in :
/tmp/ltsmin635084182191222695
[2025-05-31 11:41:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin635084182191222695
Running compilation step : cd /tmp/ltsmin635084182191222695;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin635084182191222695;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin635084182191222695;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1314/1314 places, 1952/1952 transitions.
Applied a total of 0 rules in 32 ms. Remains 1314 /1314 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1314 cols
[2025-05-31 11:41:06] [INFO ] Computed 79 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:41:06] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-31 11:41:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:41:07] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2025-05-31 11:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 1314/1314 places, 1952/1952 transitions.
Built C files in :
/tmp/ltsmin5320714350331470104
[2025-05-31 11:42:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5320714350331470104
Running compilation step : cd /tmp/ltsmin5320714350331470104;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5320714350331470104;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5320714350331470104;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 11:42:11] [INFO ] Flatten gal took : 29 ms
[2025-05-31 11:42:11] [INFO ] Flatten gal took : 38 ms
[2025-05-31 11:42:11] [INFO ] Time to serialize gal into /tmp/LTL6774128289212332590.gal : 8 ms
[2025-05-31 11:42:11] [INFO ] Time to serialize properties into /tmp/LTL9581071519426332184.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6774128289212332590.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14870970646161362268.hoa' '-atoms' '/tmp/LTL9581071519426332184.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9581071519426332184.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14870970646161362268.hoa
Detected timeout of ITS tools.
[2025-05-31 11:42:26] [INFO ] Flatten gal took : 29 ms
[2025-05-31 11:42:26] [INFO ] Flatten gal took : 29 ms
[2025-05-31 11:42:26] [INFO ] Time to serialize gal into /tmp/LTL6305189111544864883.gal : 6 ms
[2025-05-31 11:42:26] [INFO ] Time to serialize properties into /tmp/LTL9940039548329903797.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/LTL6305189111544864883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9940039548329903797.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(((F("(p110==1)"))U("((p110==1)||(p2108==1))"))U("(p966==1)"))))U((X(X(G(((F("(p110==1)"))U("((p110==1)||(p2108==1))"))U("(p966...255
Formula 0 simplified : XX((G!"(p110==1)" R !"((p110==1)||(p2108==1))") R !"(p966==1)") R (XXF((G!"(p110==1)" R !"((p110==1)||(p2108==1))") R !"(p966==1)") ...238
Detected timeout of ITS tools.
[2025-05-31 11:42:41] [INFO ] Flatten gal took : 31 ms
[2025-05-31 11:42:41] [INFO ] Applying decomposition
[2025-05-31 11:42:41] [INFO ] Flatten gal took : 31 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/graph10222429388026067998.txt' '-o' '/tmp/graph10222429388026067998.bin' '-w' '/tmp/graph10222429388026067998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10222429388026067998.bin' '-l' '-1' '-v' '-w' '/tmp/graph10222429388026067998.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:42:41] [INFO ] Decomposing Gal with order
[2025-05-31 11:42:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:42:41] [INFO ] Removed a total of 1428 redundant transitions.
[2025-05-31 11:42:41] [INFO ] Flatten gal took : 75 ms
[2025-05-31 11:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 64 ms.
[2025-05-31 11:42:41] [INFO ] Time to serialize gal into /tmp/LTL8722472114338550374.gal : 10 ms
[2025-05-31 11:42:41] [INFO ] Time to serialize properties into /tmp/LTL17042233926770947016.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8722472114338550374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17042233926770947016.ltl' '-c' '-stutter-deadlock'
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...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(((F("(i2.u24.p110==1)"))U("((i2.u24.p110==1)||(i14.u423.p2108==1))"))U("(i11.u184.p966==1)"))))U((X(X(G(((F("(i2.u24.p110==1)"...360
Formula 0 simplified : XX((G!"(i2.u24.p110==1)" R !"((i2.u24.p110==1)||(i14.u423.p2108==1))") R !"(i11.u184.p966==1)") R (XXF((G!"(i2.u24.p110==1)" R !"((i...343
Detected timeout of ITS tools.
Treatment of property DLCshifumi-PT-2b-LTLFireability-09 finished in 346805 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 U p1)&&X((G(p2) U !p1)))))'
Support contains 2 out of 1371 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1352 transition count 1993
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1352 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1352 transition count 1992
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 1340 transition count 1979
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 1340 transition count 1979
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 1333 transition count 1972
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 1333 transition count 1972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 1328 transition count 1966
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 1328 transition count 1966
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 1324 transition count 1962
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 1324 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 1320 transition count 1958
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 1320 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 1317 transition count 1955
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 1315 transition count 1953
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 1313 transition count 1951
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 1313 transition count 1951
Applied a total of 118 rules in 317 ms. Remains 1313 /1371 variables (removed 58) and now considering 1951/2027 (removed 76) transitions.
// Phase 1: matrix 1951 rows 1313 cols
[2025-05-31 11:42:57] [INFO ] Computed 79 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:42:57] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-05-31 11:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:42:58] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
Running 1950 sub problems to find dead transitions.
[2025-05-31 11:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 1950/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1950 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 0/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 1950 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Starting structural reductions in LTL mode, iteration 1 : 1313/1371 places, 1951/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62021 ms. Remains : 1313/1371 places, 1951/2027 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), p1]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-12
Product exploration explored 100000 steps with 99 reset in 296 ms.
Product exploration explored 100000 steps with 100 reset in 314 ms.
Computed a total of 144 stabilizing places and 144 stable transitions
Computed a total of 144 stabilizing places and 144 stable transitions
Detected a total of 144/1313 stabilizing places and 144/1951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
RANDOM walk for 3717 steps (0 resets) in 19 ms. (185 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 12 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[p1, p1]
Stuttering acceptance computed with spot in 78 ms :[p1, p1]
[2025-05-31 11:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:44:00] [INFO ] [Real]Absence check using 79 positive place invariants in 229 ms returned sat
[2025-05-31 11:44:08] [INFO ] [Real]Absence check using state equation in 7639 ms returned sat
[2025-05-31 11:44:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:44:09] [INFO ] [Nat]Absence check using 79 positive place invariants in 189 ms returned sat
[2025-05-31 11:44:15] [INFO ] [Nat]Absence check using state equation in 6078 ms returned sat
[2025-05-31 11:44:15] [INFO ] Computed and/alt/rep : 1892/3089/1892 causal constraints (skipped 58 transitions) in 77 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 11:44:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p1
Could not prove EG p1
Support contains 1 out of 1313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 1951/1951 transitions.
Graph (trivial) has 1238 edges and 1313 vertex of which 305 / 1313 are part of one of the 24 SCC in 0 ms
Free SCC test removed 281 places
Ensure Unique test removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 282 place count 1031 transition count 1355
Reduce places removed 281 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 332 rules applied. Total rules applied 614 place count 750 transition count 1304
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 36 rules applied. Total rules applied 650 place count 716 transition count 1302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 652 place count 714 transition count 1302
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 652 place count 714 transition count 1194
Deduced a syphon composed of 108 places in 1 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 868 place count 606 transition count 1194
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 907 place count 567 transition count 1035
Iterating global reduction 4 with 39 rules applied. Total rules applied 946 place count 567 transition count 1035
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 961 place count 567 transition count 1020
Performed 198 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 5 with 396 rules applied. Total rules applied 1357 place count 369 transition count 820
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1359 place count 369 transition count 818
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1377 place count 351 transition count 740
Iterating global reduction 6 with 18 rules applied. Total rules applied 1395 place count 351 transition count 740
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1412 place count 351 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1414 place count 350 transition count 722
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1512 place count 301 transition count 794
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1527 place count 286 transition count 730
Iterating global reduction 7 with 15 rules applied. Total rules applied 1542 place count 286 transition count 730
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1574 place count 286 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1586 place count 286 transition count 686
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1588 place count 284 transition count 682
Iterating global reduction 8 with 2 rules applied. Total rules applied 1590 place count 284 transition count 682
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1592 place count 282 transition count 650
Iterating global reduction 8 with 2 rules applied. Total rules applied 1594 place count 282 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1596 place count 282 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1597 place count 281 transition count 647
Applied a total of 1597 rules in 104 ms. Remains 281 /1313 variables (removed 1032) and now considering 647/1951 (removed 1304) transitions.
[2025-05-31 11:44:23] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
// Phase 1: matrix 617 rows 281 cols
[2025-05-31 11:44:23] [INFO ] Computed 79 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:44:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-31 11:44:23] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2025-05-31 11:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:44:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 11:44:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:44:24] [INFO ] Redundant transitions in 6 ms returned []
Running 567 sub problems to find dead transitions.
[2025-05-31 11:44:24] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2025-05-31 11:44:24] [INFO ] Invariant cache hit.
[2025-05-31 11:44:24] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 3/281 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 616/897 variables, 281/360 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 49/409 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/898 variables, and 409 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 281/281 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 567 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 2 (OVERLAPS) 3/281 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 4 (OVERLAPS) 616/897 variables, 281/360 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 49/409 constraints. Problems are: Problem set: 0 solved, 567 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 567/976 constraints. Problems are: Problem set: 0 solved, 567 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/898 variables, and 976 constraints, problems are : Problem set: 0 solved, 567 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 281/281 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 567/567 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 567 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 281/1313 places, 647/1951 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60747 ms. Remains : 281/1313 places, 647/1951 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
RANDOM walk for 300 steps (0 resets) in 23 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Stuttering acceptance computed with spot in 74 ms :[p1, p1]
[2025-05-31 11:45:24] [INFO ] Flow matrix only has 617 transitions (discarded 30 similar events)
[2025-05-31 11:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:45:25] [INFO ] [Real]Absence check using 79 positive place invariants in 18 ms returned sat
[2025-05-31 11:45:25] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2025-05-31 11:45:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 11:45:25] [INFO ] [Nat]Absence check using 79 positive place invariants in 19 ms returned sat
[2025-05-31 11:45:25] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2025-05-31 11:45:25] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 11:45:25] [INFO ] [Nat]Added 49 Read/Feed constraints in 11 ms returned sat
[2025-05-31 11:45:25] [INFO ] Computed and/alt/rep : 383/839/383 causal constraints (skipped 169 transitions) in 21 ms.
[2025-05-31 11:45:25] [INFO ] Added : 17 causal constraints over 4 iterations in 177 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 50 ms :[p1, p1]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-12 finished in 149111 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(F(p1)))))'
Support contains 2 out of 1371 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Graph (trivial) has 1306 edges and 1371 vertex of which 328 / 1371 are part of one of the 23 SCC in 0 ms
Free SCC test removed 305 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1065 transition count 1373
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 367 rules applied. Total rules applied 680 place count 753 transition count 1318
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 718 place count 717 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 719 place count 716 transition count 1316
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 719 place count 716 transition count 1212
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 927 place count 612 transition count 1212
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 980 place count 559 transition count 1009
Iterating global reduction 4 with 53 rules applied. Total rules applied 1033 place count 559 transition count 1009
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1048 place count 559 transition count 994
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1048 place count 559 transition count 989
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1058 place count 554 transition count 989
Performed 191 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 5 with 382 rules applied. Total rules applied 1440 place count 363 transition count 796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1442 place count 363 transition count 794
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1460 place count 345 transition count 702
Iterating global reduction 6 with 18 rules applied. Total rules applied 1478 place count 345 transition count 702
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1496 place count 345 transition count 684
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 1596 place count 295 transition count 759
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1611 place count 280 transition count 693
Iterating global reduction 7 with 15 rules applied. Total rules applied 1626 place count 280 transition count 693
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1658 place count 280 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1676 place count 280 transition count 643
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1680 place count 276 transition count 635
Iterating global reduction 8 with 4 rules applied. Total rules applied 1684 place count 276 transition count 635
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1688 place count 272 transition count 567
Iterating global reduction 8 with 4 rules applied. Total rules applied 1692 place count 272 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1696 place count 272 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1697 place count 271 transition count 562
Applied a total of 1697 rules in 95 ms. Remains 271 /1371 variables (removed 1100) and now considering 562/2027 (removed 1465) transitions.
[2025-05-31 11:45:25] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
// Phase 1: matrix 537 rows 271 cols
[2025-05-31 11:45:25] [INFO ] Computed 79 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:45:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-31 11:45:26] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2025-05-31 11:45:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:45:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 11:45:26] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 11:45:26] [INFO ] Redundant transitions in 5 ms returned []
Running 477 sub problems to find dead transitions.
[2025-05-31 11:45:26] [INFO ] Flow matrix only has 537 transitions (discarded 25 similar events)
[2025-05-31 11:45:26] [INFO ] Invariant cache hit.
[2025-05-31 11:45:26] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 536/807 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 45/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/808 variables, and 395 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 536/807 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 45/395 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 477/872 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 11:46:12] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/808 variables, and 873 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 271/271 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 271/1371 places, 562/2027 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60647 ms. Remains : 271/1371 places, 562/2027 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-13 finished in 60744 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)))'
Support contains 1 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1352 transition count 1993
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1352 transition count 1993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 1352 transition count 1992
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 1339 transition count 1978
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 1339 transition count 1978
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 1332 transition count 1971
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 1332 transition count 1971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 1332 transition count 1970
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1327 transition count 1965
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1327 transition count 1965
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 1323 transition count 1961
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 1323 transition count 1961
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 1319 transition count 1957
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 1319 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 1316 transition count 1954
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 1312 transition count 1950
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1312 transition count 1950
Applied a total of 120 rules in 329 ms. Remains 1312 /1371 variables (removed 59) and now considering 1950/2027 (removed 77) transitions.
// Phase 1: matrix 1950 rows 1312 cols
[2025-05-31 11:46:26] [INFO ] Computed 79 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:46:27] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-05-31 11:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:46:28] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2025-05-31 11:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 1312/1371 places, 1950/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62053 ms. Remains : 1312/1371 places, 1950/2027 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-14
Stuttering criterion allowed to conclude after 37947 steps with 9 reset in 130 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-14 finished in 62275 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)&&X((G(p1)&&X(F((p2||G(p3))))))))'
Support contains 4 out of 1371 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1371/1371 places, 2027/2027 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1354 transition count 2010
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1354 transition count 2010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1354 transition count 2009
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 1343 transition count 1997
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 1343 transition count 1997
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 1338 transition count 1992
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 1338 transition count 1992
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 1338 transition count 1991
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 1335 transition count 1988
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 1335 transition count 1988
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 1332 transition count 1985
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 1332 transition count 1985
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 1329 transition count 1982
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 1329 transition count 1982
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 1326 transition count 1979
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 1326 transition count 1979
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 1324 transition count 1977
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1324 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1322 transition count 1975
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1322 transition count 1975
Applied a total of 100 rules in 322 ms. Remains 1322 /1371 variables (removed 49) and now considering 1975/2027 (removed 52) transitions.
// Phase 1: matrix 1975 rows 1322 cols
[2025-05-31 11:47:29] [INFO ] Computed 79 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:47:29] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-05-31 11:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 11:47:30] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Running 1974 sub problems to find dead transitions.
[2025-05-31 11:47:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/3297 variables, and 0 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1322 constraints, PredecessorRefiner: 1974/1974 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1974 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/3297 variables, and 0 constraints, problems are : Problem set: 0 solved, 1974 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1322 constraints, PredecessorRefiner: 0/1974 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 1974 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Starting structural reductions in LTL mode, iteration 1 : 1322/1371 places, 1975/2027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62079 ms. Remains : 1322/1371 places, 1975/2027 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-15 finished in 62351 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(X(G(X(F((X(!(!p0 U X(X(p0))))&&p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(X((!p1&&X((!p1 U (p2||G(!p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(((F(p0) U p1) U p2))) U ((!p2&&X(X(((F(p0) U p1) U p2))))||X(X(G(((F(p0) U p1) U p2)))))))'
[2025-05-31 11:48:31] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10698550189376318221
[2025-05-31 11:48:31] [INFO ] Too many transitions (2027) to apply POR reductions. Disabling POR matrices.
[2025-05-31 11:48:31] [INFO ] Applying decomposition
[2025-05-31 11:48:31] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10698550189376318221
Running compilation step : cd /tmp/ltsmin10698550189376318221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 11:48:31] [INFO ] Flatten gal took : 39 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/graph17166430461458278073.txt' '-o' '/tmp/graph17166430461458278073.bin' '-w' '/tmp/graph17166430461458278073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17166430461458278073.bin' '-l' '-1' '-v' '-w' '/tmp/graph17166430461458278073.weights' '-q' '0' '-e' '0.001'
[2025-05-31 11:48:31] [INFO ] Decomposing Gal with order
[2025-05-31 11:48:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 11:48:31] [INFO ] Removed a total of 1464 redundant transitions.
[2025-05-31 11:48:32] [INFO ] Flatten gal took : 65 ms
[2025-05-31 11:48:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 14 ms.
[2025-05-31 11:48:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6672610367602689113.gal : 13 ms
[2025-05-31 11:48:32] [INFO ] Time to serialize properties into /tmp/LTLFireability6998524053038257371.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/LTLFireability6672610367602689113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6998524053038257371.ltl' '-c' '-stutter-deadlock'
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 3 LTL properties
Checking formula 0 : !((G(X(G(X(F((X(!((!("((i19.i1.i0.u350.p1706==1)&&(i19.i1.i0.u506.p2406==1))"))U(X(X("((i19.i1.i0.u350.p1706==1)&&(i19.i1.i0.u506.p240...197
Formula 0 simplified : FG(!"(i5.u77.p367==0)" | X(!"((i19.i1.i0.u350.p1706==1)&&(i19.i1.i0.u506.p2406==1))" U XX"((i19.i1.i0.u350.p1706==1)&&(i19.i1.i0.u50...170
Compilation finished in 4012 ms.
Running link step : cd /tmp/ltsmin10698550189376318221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin10698550189376318221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](X(<>((X(!(!(LTLAPp0==true) U X(X((LTLAPp0==true)))))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
LTSmin run took 14403 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10698550189376318221;'/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' '((<>((LTLAPp2==true)) U (LTLAPp3==true)) U X(X((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true)))))))))' '--buchi-type=spotba'
LTSmin run took 612 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10698550189376318221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X(((<>((LTLAPp5==true)) U (LTLAPp6==true)) U (LTLAPp7==true)))) U ((!(LTLAPp7==true)&&X(X(((<>((LTLAPp5==true)) U (LTLAPp6==true)) U (LTLAPp7==true)))))||X(X([](((<>((LTLAPp5==true)) U (LTLAPp6==true)) U (LTLAPp7==true)))))))' '--buchi-type=spotba'
LTSmin run took 3668 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1640662 ms.
BK_STOP 1748692134608
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DLCshifumi-PT-2b"
export BK_EXAMINATION="LTLFireability"
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 DLCshifumi-PT-2b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067200300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;