About the Execution of ITS-Tools for DiscoveryGPU-PT-13b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?????TTFT?????T? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700730.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 DiscoveryGPU-PT-13b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700730
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 97K 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 DiscoveryGPU-PT-13b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-15
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-00
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-01
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-02
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-03
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-04
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-05
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-06
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-07
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-08
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-09
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-10
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748944988249
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 10:03:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 10:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 10:03:10] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2025-06-03 10:03:10] [INFO ] Transformed 380 places.
[2025-06-03 10:03:10] [INFO ] Transformed 404 transitions.
[2025-06-03 10:03:10] [INFO ] Found NUPN structural information;
[2025-06-03 10:03:10] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 82 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 74 place count 306 transition count 356
Iterating global reduction 1 with 48 rules applied. Total rules applied 122 place count 306 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 130 place count 298 transition count 348
Iterating global reduction 1 with 8 rules applied. Total rules applied 138 place count 298 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 293 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 293 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 291 transition count 341
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 291 transition count 341
Applied a total of 152 rules in 219 ms. Remains 291 /380 variables (removed 89) and now considering 341/404 (removed 63) transitions.
// Phase 1: matrix 341 rows 291 cols
[2025-06-03 10:03:11] [INFO ] Computed 2 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:03:11] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-03 10:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:03:12] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2025-06-03 10:03:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 341/632 variables, 291/293 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:29] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:29] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:29] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:30] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:30] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:30] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:30] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:31] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:31] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:31] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:32] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:32] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:03:32] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/632 variables, 13/306 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 306 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 341/632 variables, 291/306 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 340/646 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 646 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Starting structural reductions in LTL mode, iteration 1 : 291/380 places, 341/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61590 ms. Remains : 291/380 places, 341/404 transitions.
Support contains 82 out of 291 places after structural reductions.
[2025-06-03 10:04:12] [INFO ] Flatten gal took : 75 ms
[2025-06-03 10:04:13] [INFO ] Flatten gal took : 35 ms
[2025-06-03 10:04:13] [INFO ] Input system was already deterministic with 341 transitions.
Support contains 78 out of 291 places (down from 82) after GAL structural reductions.
RANDOM walk for 40000 steps (95 resets) in 2927 ms. (13 steps per ms) remains 2/69 properties
BEST_FIRST walk for 40004 steps (12 resets) in 294 ms. (135 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2025-06-03 10:04:14] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/133 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 412/545 variables, 204/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/625 variables, 68/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/632 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/632 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/632 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 291/291 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/133 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 412/545 variables, 204/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/625 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/632 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/632 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/632 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 632/632 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1589 steps, including 72 resets, run visited all 1 properties in 8 ms. (steps per millisecond=198 )
Parikh walk visited 1 properties in 15 ms.
[2025-06-03 10:04:15] [INFO ] Flatten gal took : 39 ms
[2025-06-03 10:04:15] [INFO ] Flatten gal took : 48 ms
[2025-06-03 10:04:15] [INFO ] Input system was already deterministic with 341 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 564 edges and 291 vertex of which 281 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 265 transition count 315
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 265 transition count 315
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 253 transition count 298
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 253 transition count 298
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 242 transition count 287
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 242 transition count 287
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 232 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 232 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 226 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 226 transition count 265
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 136 place count 220 transition count 259
Iterating global reduction 0 with 6 rules applied. Total rules applied 142 place count 220 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 215 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 215 transition count 254
Applied a total of 152 rules in 77 ms. Remains 215 /291 variables (removed 76) and now considering 254/341 (removed 87) transitions.
// Phase 1: matrix 254 rows 215 cols
[2025-06-03 10:04:15] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:04:15] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-03 10:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:04:15] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-03 10:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 254/469 variables, 215/217 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:27] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:28] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:04:29] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/469 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 230 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/469 variables, 215/230 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 253/483 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 483 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 215/291 places, 254/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60832 ms. Remains : 215/291 places, 254/341 transitions.
[2025-06-03 10:05:16] [INFO ] Flatten gal took : 14 ms
[2025-06-03 10:05:16] [INFO ] Flatten gal took : 14 ms
[2025-06-03 10:05:16] [INFO ] Input system was already deterministic with 254 transitions.
[2025-06-03 10:05:16] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:05:16] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:05:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3528572494792052989.gal : 11 ms
[2025-06-03 10:05:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6061632123865308689.ctl : 5 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3528572494792052989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6061632123865308689.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:05:46] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:05:46] [INFO ] Applying decomposition
[2025-06-03 10:05:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17100329111724497287.txt' '-o' '/tmp/graph17100329111724497287.bin' '-w' '/tmp/graph17100329111724497287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17100329111724497287.bin' '-l' '-1' '-v' '-w' '/tmp/graph17100329111724497287.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:05:46] [INFO ] Decomposing Gal with order
[2025-06-03 10:05:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:05:46] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 10:05:46] [INFO ] Flatten gal took : 132 ms
[2025-06-03 10:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 27 ms.
[2025-06-03 10:05:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9588514637014360104.gal : 25 ms
[2025-06-03 10:05:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5491532678125590925.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9588514637014360104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5491532678125590925.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 283 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 282 transition count 282
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 232 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 231 transition count 281
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 103 place count 231 transition count 243
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 179 place count 193 transition count 243
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 189 place count 183 transition count 232
Iterating global reduction 3 with 10 rules applied. Total rules applied 199 place count 183 transition count 232
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 208 place count 174 transition count 220
Iterating global reduction 3 with 9 rules applied. Total rules applied 217 place count 174 transition count 220
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 225 place count 166 transition count 207
Iterating global reduction 3 with 8 rules applied. Total rules applied 233 place count 166 transition count 207
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 161 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 161 transition count 202
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 291 place count 137 transition count 178
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 293 place count 135 transition count 175
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 135 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 297 place count 133 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 299 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 300 place count 132 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 132 transition count 171
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 132 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 304 place count 130 transition count 169
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 154 edges and 128 vertex of which 124 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 132 edges and 124 vertex of which 52 / 124 are part of one of the 26 SCC in 4 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 3 with 41 rules applied. Total rules applied 345 place count 98 transition count 127
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 64 rules applied. Total rules applied 409 place count 61 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 410 place count 60 transition count 100
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 421 place count 49 transition count 78
Iterating global reduction 6 with 11 rules applied. Total rules applied 432 place count 49 transition count 78
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 441 place count 40 transition count 60
Iterating global reduction 6 with 9 rules applied. Total rules applied 450 place count 40 transition count 60
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 459 place count 31 transition count 42
Iterating global reduction 6 with 9 rules applied. Total rules applied 468 place count 31 transition count 42
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 477 place count 22 transition count 33
Iterating global reduction 6 with 9 rules applied. Total rules applied 486 place count 22 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 488 place count 22 transition count 31
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 6 with 1 rules applied. Total rules applied 489 place count 22 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 490 place count 21 transition count 30
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 494 place count 17 transition count 26
Applied a total of 494 rules in 152 ms. Remains 17 /291 variables (removed 274) and now considering 26/341 (removed 315) transitions.
[2025-06-03 10:06:17] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 17 cols
[2025-06-03 10:06:17] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 10:06:17] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-03 10:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:06:17] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 10:06:17] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2025-06-03 10:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/37 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 452 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 20/33 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/37 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 415 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 878ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/291 places, 26/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1137 ms. Remains : 17/291 places, 26/341 transitions.
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 7 ms
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:18] [INFO ] Input system was already deterministic with 26 transitions.
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:06:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6642278886914798640.gal : 1 ms
[2025-06-03 10:06:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7268901309929771130.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6642278886914798640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7268901309929771130.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,12771,0.011942,3768,2,49,5,459,6,0,83,521,0
Converting to forward existential form...Done !
original formula: EF((EF((!(A((p315==1) U (p275==1))) + (p247==0))) * (p317==1)))
=> equivalent forward existential formula: (([(FwdU(FwdU((FwdU(Init,TRUE) * (p317==1)),TRUE),!((p275==1))) * (!((p315==1)) * !((p275==1))))] != FALSE + [Fw...292
Hit Full ! (commute/partial/dont) 24/0/2
(forward)formula 0,1,0.016256,4024,1,0,13,459,21,4,196,521,8
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 282 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 281 transition count 280
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 230 transition count 280
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 103 place count 230 transition count 242
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 179 place count 192 transition count 242
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 189 place count 182 transition count 231
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 182 transition count 231
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 208 place count 173 transition count 219
Iterating global reduction 2 with 9 rules applied. Total rules applied 217 place count 173 transition count 219
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 225 place count 165 transition count 207
Iterating global reduction 2 with 8 rules applied. Total rules applied 233 place count 165 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 238 place count 160 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 243 place count 160 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 159 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 159 transition count 200
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 293 place count 135 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 295 place count 133 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 133 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 299 place count 131 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 301 place count 131 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 130 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 130 transition count 169
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 128 transition count 167
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 152 edges and 126 vertex of which 122 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 135 edges and 122 vertex of which 52 / 122 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 45 rules applied. Total rules applied 350 place count 96 transition count 121
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 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 3 with 69 rules applied. Total rules applied 419 place count 55 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 420 place count 54 transition count 93
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 431 place count 43 transition count 71
Iterating global reduction 5 with 11 rules applied. Total rules applied 442 place count 43 transition count 71
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 453 place count 32 transition count 49
Iterating global reduction 5 with 11 rules applied. Total rules applied 464 place count 32 transition count 49
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 475 place count 21 transition count 27
Iterating global reduction 5 with 11 rules applied. Total rules applied 486 place count 21 transition count 27
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 497 place count 10 transition count 16
Iterating global reduction 5 with 11 rules applied. Total rules applied 508 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 509 place count 10 transition count 15
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 5 with 1 rules applied. Total rules applied 510 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 513 place count 7 transition count 12
Applied a total of 513 rules in 126 ms. Remains 7 /291 variables (removed 284) and now considering 12/341 (removed 329) transitions.
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 10:06:18] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 10:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:06:18] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 10:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 182 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 183 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 369ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 369ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/291 places, 12/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 563 ms. Remains : 7/291 places, 12/341 transitions.
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:06:18] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:06:18] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 107 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 10:06:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5978735567265567124.gal : 0 ms
[2025-06-03 10:06:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14468239677862796957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5978735567265567124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14468239677862796957.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 281 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 280 transition count 279
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 229 transition count 279
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 103 place count 229 transition count 242
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 177 place count 192 transition count 242
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 187 place count 182 transition count 231
Iterating global reduction 2 with 10 rules applied. Total rules applied 197 place count 182 transition count 231
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 206 place count 173 transition count 220
Iterating global reduction 2 with 9 rules applied. Total rules applied 215 place count 173 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 165 transition count 207
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 165 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 237 place count 159 transition count 200
Iterating global reduction 2 with 6 rules applied. Total rules applied 243 place count 159 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 158 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 158 transition count 199
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 293 place count 134 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 295 place count 132 transition count 172
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 132 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 299 place count 130 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 301 place count 130 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 129 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 129 transition count 168
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 129 transition count 168
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 127 transition count 166
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 186 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 131 edges and 125 vertex of which 52 / 125 are part of one of the 26 SCC in 0 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 322 place count 99 transition count 152
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 361 place count 86 transition count 126
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 361 place count 86 transition count 113
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 387 place count 73 transition count 113
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 398 place count 62 transition count 91
Iterating global reduction 4 with 11 rules applied. Total rules applied 409 place count 62 transition count 91
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 420 place count 51 transition count 69
Iterating global reduction 4 with 11 rules applied. Total rules applied 431 place count 51 transition count 69
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 442 place count 40 transition count 58
Iterating global reduction 4 with 11 rules applied. Total rules applied 453 place count 40 transition count 58
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 464 place count 29 transition count 36
Iterating global reduction 4 with 11 rules applied. Total rules applied 475 place count 29 transition count 36
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 486 place count 18 transition count 25
Iterating global reduction 4 with 11 rules applied. Total rules applied 497 place count 18 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 499 place count 16 transition count 23
Applied a total of 499 rules in 118 ms. Remains 16 /291 variables (removed 275) and now considering 23/341 (removed 318) transitions.
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 16 cols
[2025-06-03 10:06:18] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2025-06-03 10:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:06:18] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 10:06:18] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2025-06-03 10:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 19/33 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/36 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 19/33 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/35 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/36 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1034ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1035ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/291 places, 23/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1261 ms. Remains : 16/291 places, 23/341 transitions.
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:20] [INFO ] Input system was already deterministic with 23 transitions.
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4959900722340017448.gal : 0 ms
[2025-06-03 10:06:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11985219504377779223.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4959900722340017448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11985219504377779223.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,806208,0.051356,4824,2,99,5,6479,6,0,81,7236,0
Converting to forward existential form...Done !
original formula: AF(AG(((p129==0)||(p378==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p129==0)||(p378==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t21, Intersection with reachable at each step enabled. (destroyed/r...189
(forward)formula 0,0,0.258517,10456,1,0,258,37465,70,235,567,51372,268
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 281 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 280
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 230 transition count 280
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 101 place count 230 transition count 242
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 177 place count 192 transition count 242
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 181 transition count 230
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 181 transition count 230
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 209 place count 171 transition count 217
Iterating global reduction 2 with 10 rules applied. Total rules applied 219 place count 171 transition count 217
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 228 place count 162 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 237 place count 162 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 243 place count 156 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 156 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 155 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 155 transition count 195
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 299 place count 131 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 129 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 127 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 126 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 126 transition count 164
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 126 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 124 transition count 162
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 148 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 129 edges and 118 vertex of which 50 / 118 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 42 rules applied. Total rules applied 354 place count 93 transition count 119
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 64 rules applied. Total rules applied 418 place count 55 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 419 place count 54 transition count 93
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 431 place count 42 transition count 69
Iterating global reduction 5 with 12 rules applied. Total rules applied 443 place count 42 transition count 69
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 455 place count 30 transition count 45
Iterating global reduction 5 with 12 rules applied. Total rules applied 467 place count 30 transition count 45
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 478 place count 19 transition count 23
Iterating global reduction 5 with 11 rules applied. Total rules applied 489 place count 19 transition count 23
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 500 place count 8 transition count 12
Iterating global reduction 5 with 11 rules applied. Total rules applied 511 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 512 place count 8 transition count 11
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 5 with 2 rules applied. Total rules applied 514 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 516 place count 5 transition count 8
Applied a total of 516 rules in 98 ms. Remains 5 /291 variables (removed 286) and now considering 8/341 (removed 333) transitions.
[2025-06-03 10:06:20] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2025-06-03 10:06:20] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 10:06:20] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 10:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:06:20] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 10:06:20] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 10:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 83 ms.
Refiners :[State Equation: 5/5 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 97 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/291 places, 8/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 329 ms. Remains : 5/291 places, 8/341 transitions.
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 2 ms
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 5 ms
[2025-06-03 10:06:20] [INFO ] Input system was already deterministic with 8 transitions.
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:06:20] [INFO ] Flatten gal took : 0 ms
[2025-06-03 10:06:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9116040812681567840.gal : 0 ms
[2025-06-03 10:06:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16909508783566948315.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9116040812681567840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16909508783566948315.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 316
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 255 transition count 300
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 255 transition count 300
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 245 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 245 transition count 290
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 102 place count 235 transition count 279
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 235 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 229 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 229 transition count 268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 130 place count 223 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 136 place count 223 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 141 place count 218 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 146 place count 218 transition count 257
Applied a total of 146 rules in 47 ms. Remains 218 /291 variables (removed 73) and now considering 257/341 (removed 84) transitions.
// Phase 1: matrix 257 rows 218 cols
[2025-06-03 10:06:20] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:20] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-03 10:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:06:21] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 10:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/475 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:32] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:32] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:32] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:33] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:34] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:34] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:34] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:06:34] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 233 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/475 variables, 218/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 256/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/475 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 489 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 218/291 places, 257/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 218/291 places, 257/341 transitions.
[2025-06-03 10:07:21] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:07:21] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:07:21] [INFO ] Input system was already deterministic with 257 transitions.
[2025-06-03 10:07:21] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:07:21] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:07:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7361716082948471932.gal : 2 ms
[2025-06-03 10:07:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15421578778480827379.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7361716082948471932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15421578778480827379.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:07:51] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:07:51] [INFO ] Applying decomposition
[2025-06-03 10:07:51] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2586151704548605909.txt' '-o' '/tmp/graph2586151704548605909.bin' '-w' '/tmp/graph2586151704548605909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2586151704548605909.bin' '-l' '-1' '-v' '-w' '/tmp/graph2586151704548605909.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:07:51] [INFO ] Decomposing Gal with order
[2025-06-03 10:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:07:51] [INFO ] Removed a total of 105 redundant transitions.
[2025-06-03 10:07:51] [INFO ] Flatten gal took : 37 ms
[2025-06-03 10:07:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2025-06-03 10:07:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15775354480148369501.gal : 10 ms
[2025-06-03 10:07:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8031661003532919477.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15775354480148369501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8031661003532919477.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 316
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 255 transition count 301
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 255 transition count 301
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 244 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 244 transition count 290
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 105 place count 233 transition count 277
Iterating global reduction 0 with 11 rules applied. Total rules applied 116 place count 233 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 123 place count 226 transition count 265
Iterating global reduction 0 with 7 rules applied. Total rules applied 130 place count 226 transition count 265
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 219 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 149 place count 214 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 154 place count 214 transition count 253
Applied a total of 154 rules in 41 ms. Remains 214 /291 variables (removed 77) and now considering 253/341 (removed 88) transitions.
// Phase 1: matrix 253 rows 214 cols
[2025-06-03 10:08:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-03 10:08:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:08:22] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-03 10:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:33] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:33] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:33] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:34] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:34] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:34] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:34] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:34] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:35] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:35] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:35] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:35] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:08:35] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 229 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 481 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 214/291 places, 253/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 214/291 places, 253/341 transitions.
[2025-06-03 10:09:22] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:09:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:09:22] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-03 10:09:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 10:09:22] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:09:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10769587678968059066.gal : 2 ms
[2025-06-03 10:09:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3752748438554483295.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10769587678968059066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3752748438554483295.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:09:52] [INFO ] Flatten gal took : 13 ms
[2025-06-03 10:09:52] [INFO ] Applying decomposition
[2025-06-03 10:09:52] [INFO ] Flatten gal took : 12 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/graph7554873974472632941.txt' '-o' '/tmp/graph7554873974472632941.bin' '-w' '/tmp/graph7554873974472632941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7554873974472632941.bin' '-l' '-1' '-v' '-w' '/tmp/graph7554873974472632941.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:09:52] [INFO ] Decomposing Gal with order
[2025-06-03 10:09:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:09:52] [INFO ] Removed a total of 103 redundant transitions.
[2025-06-03 10:09:52] [INFO ] Flatten gal took : 32 ms
[2025-06-03 10:09:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2025-06-03 10:09:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8519856906521776200.gal : 7 ms
[2025-06-03 10:09:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14515414666684074718.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8519856906521776200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14515414666684074718.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 318
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 256 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 256 transition count 301
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 82 place count 244 transition count 289
Iterating global reduction 0 with 12 rules applied. Total rules applied 94 place count 244 transition count 289
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 106 place count 232 transition count 275
Iterating global reduction 0 with 12 rules applied. Total rules applied 118 place count 232 transition count 275
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 225 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 225 transition count 263
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 218 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 218 transition count 256
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 151 place count 213 transition count 251
Iterating global reduction 0 with 5 rules applied. Total rules applied 156 place count 213 transition count 251
Applied a total of 156 rules in 38 ms. Remains 213 /291 variables (removed 78) and now considering 251/341 (removed 90) transitions.
// Phase 1: matrix 251 rows 213 cols
[2025-06-03 10:10:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:22] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-03 10:10:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:10:23] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2025-06-03 10:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 251/464 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:35] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:36] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:10:37] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 228 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 251/464 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 250/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 478 constraints, problems are : Problem set: 0 solved, 250 unsolved in 28884 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58957ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 58959ms
Starting structural reductions in LTL mode, iteration 1 : 213/291 places, 251/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59538 ms. Remains : 213/291 places, 251/341 transitions.
[2025-06-03 10:11:22] [INFO ] Flatten gal took : 13 ms
[2025-06-03 10:11:22] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:11:22] [INFO ] Input system was already deterministic with 251 transitions.
[2025-06-03 10:11:22] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:11:22] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:11:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17269236828762994194.gal : 3 ms
[2025-06-03 10:11:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14121045041730500477.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17269236828762994194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14121045041730500477.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:11:52] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:11:52] [INFO ] Applying decomposition
[2025-06-03 10:11:52] [INFO ] Flatten gal took : 10 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/graph15434283676809738956.txt' '-o' '/tmp/graph15434283676809738956.bin' '-w' '/tmp/graph15434283676809738956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15434283676809738956.bin' '-l' '-1' '-v' '-w' '/tmp/graph15434283676809738956.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:11:52] [INFO ] Decomposing Gal with order
[2025-06-03 10:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:11:52] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 10:11:52] [INFO ] Flatten gal took : 26 ms
[2025-06-03 10:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2025-06-03 10:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14983370563608330235.gal : 5 ms
[2025-06-03 10:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7655340757747800841.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14983370563608330235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7655340757747800841.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 281 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 281
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 231 transition count 281
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 99 place count 231 transition count 244
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 173 place count 194 transition count 244
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 183 place count 184 transition count 234
Iterating global reduction 2 with 10 rules applied. Total rules applied 193 place count 184 transition count 234
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 202 place count 175 transition count 222
Iterating global reduction 2 with 9 rules applied. Total rules applied 211 place count 175 transition count 222
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 220 place count 166 transition count 208
Iterating global reduction 2 with 9 rules applied. Total rules applied 229 place count 166 transition count 208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 235 place count 160 transition count 201
Iterating global reduction 2 with 6 rules applied. Total rules applied 241 place count 160 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 159 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 159 transition count 200
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 285 place count 138 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 287 place count 136 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 289 place count 136 transition count 176
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 291 place count 134 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 293 place count 134 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 294 place count 133 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 133 transition count 172
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 133 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 131 transition count 170
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 2 with 13 rules applied. Total rules applied 312 place count 130 transition count 158
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 324 place count 118 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 324 place count 118 transition count 156
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 328 place count 116 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 115 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 331 place count 115 transition count 154
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 5 with 2 rules applied. Total rules applied 333 place count 114 transition count 153
Applied a total of 333 rules in 56 ms. Remains 114 /291 variables (removed 177) and now considering 153/341 (removed 188) transitions.
// Phase 1: matrix 153 rows 114 cols
[2025-06-03 10:12:22] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:12:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 10:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:12:22] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:12:22] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2025-06-03 10:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 153/267 variables, 114/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 0/267 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 115 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7614 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 153/267 variables, 114/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 152/267 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 267 constraints, problems are : Problem set: 0 solved, 152 unsolved in 10306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17956ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 17957ms
Starting structural reductions in SI_CTL mode, iteration 1 : 114/291 places, 153/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18244 ms. Remains : 114/291 places, 153/341 transitions.
[2025-06-03 10:12:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 10:12:40] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:12:40] [INFO ] Input system was already deterministic with 153 transitions.
[2025-06-03 10:12:40] [INFO ] Flatten gal took : 4 ms
[2025-06-03 10:12:40] [INFO ] Flatten gal took : 3 ms
[2025-06-03 10:12:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11350906065058056140.gal : 2 ms
[2025-06-03 10:12:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2767283971144427085.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11350906065058056140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2767283971144427085.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42835e+13,10.6399,218292,2,64812,5,1.51379e+06,6,0,586,727955,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 10:13:10] [INFO ] Flatten gal took : 6 ms
[2025-06-03 10:13:10] [INFO ] Applying decomposition
[2025-06-03 10:13:10] [INFO ] Flatten gal took : 8 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/graph8004418127713947765.txt' '-o' '/tmp/graph8004418127713947765.bin' '-w' '/tmp/graph8004418127713947765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8004418127713947765.bin' '-l' '-1' '-v' '-w' '/tmp/graph8004418127713947765.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:13:10] [INFO ] Decomposing Gal with order
[2025-06-03 10:13:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:13:11] [INFO ] Removed a total of 75 redundant transitions.
[2025-06-03 10:13:11] [INFO ] Flatten gal took : 12 ms
[2025-06-03 10:13:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 3 ms.
[2025-06-03 10:13:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16323177686989182384.gal : 2 ms
[2025-06-03 10:13:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17868523795763446941.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16323177686989182384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17868523795763446941.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 318
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 258 transition count 304
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 258 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 248 transition count 294
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 248 transition count 294
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 238 transition count 282
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 238 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 233 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 233 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 228 transition count 269
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 228 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 225 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 225 transition count 266
Applied a total of 132 rules in 47 ms. Remains 225 /291 variables (removed 66) and now considering 266/341 (removed 75) transitions.
// Phase 1: matrix 266 rows 225 cols
[2025-06-03 10:13:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:13:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 10:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:13:41] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-03 10:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/491 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:55] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:55] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:56] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:56] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:56] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:56] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:57] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:13:58] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 13/240 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 265 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 491/491 variables, and 240 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/491 variables, 225/240 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 265/505 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 505 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 225/291 places, 266/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 225/291 places, 266/341 transitions.
[2025-06-03 10:14:41] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:14:41] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:14:41] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-03 10:14:41] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:14:41] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16891833688339756941.gal : 3 ms
[2025-06-03 10:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13884189441410848911.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16891833688339756941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13884189441410848911.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:15:11] [INFO ] Flatten gal took : 7 ms
[2025-06-03 10:15:11] [INFO ] Applying decomposition
[2025-06-03 10:15:11] [INFO ] Flatten gal took : 7 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/graph261370463410527378.txt' '-o' '/tmp/graph261370463410527378.bin' '-w' '/tmp/graph261370463410527378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph261370463410527378.bin' '-l' '-1' '-v' '-w' '/tmp/graph261370463410527378.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:15:12] [INFO ] Decomposing Gal with order
[2025-06-03 10:15:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:15:12] [INFO ] Removed a total of 103 redundant transitions.
[2025-06-03 10:15:12] [INFO ] Flatten gal took : 18 ms
[2025-06-03 10:15:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-06-03 10:15:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1635886139280163138.gal : 4 ms
[2025-06-03 10:15:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11785622329500872336.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1635886139280163138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11785622329500872336.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Graph (complete) has 564 edges and 291 vertex of which 281 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 280
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 230 transition count 280
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 101 place count 230 transition count 242
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 177 place count 192 transition count 242
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 188 place count 181 transition count 230
Iterating global reduction 2 with 11 rules applied. Total rules applied 199 place count 181 transition count 230
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 209 place count 171 transition count 217
Iterating global reduction 2 with 10 rules applied. Total rules applied 219 place count 171 transition count 217
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 228 place count 162 transition count 203
Iterating global reduction 2 with 9 rules applied. Total rules applied 237 place count 162 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 243 place count 156 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 156 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 155 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 155 transition count 195
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 299 place count 131 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 301 place count 129 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 303 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 305 place count 127 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 307 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 126 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 126 transition count 164
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 126 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 124 transition count 162
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 148 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 130 edges and 118 vertex of which 50 / 118 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 2 with 43 rules applied. Total rules applied 355 place count 93 transition count 118
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 419 place count 54 transition count 93
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 430 place count 43 transition count 71
Iterating global reduction 4 with 11 rules applied. Total rules applied 441 place count 43 transition count 71
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 452 place count 32 transition count 49
Iterating global reduction 4 with 11 rules applied. Total rules applied 463 place count 32 transition count 49
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 474 place count 21 transition count 27
Iterating global reduction 4 with 11 rules applied. Total rules applied 485 place count 21 transition count 27
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 496 place count 10 transition count 16
Iterating global reduction 4 with 11 rules applied. Total rules applied 507 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 10 transition count 15
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 4 with 1 rules applied. Total rules applied 509 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 510 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 512 place count 7 transition count 12
Applied a total of 512 rules in 56 ms. Remains 7 /291 variables (removed 284) and now considering 12/341 (removed 329) transitions.
[2025-06-03 10:15:42] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 10:15:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:15:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-03 10:15:42] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 10:15:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:15:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:15:42] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 10:15:42] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2025-06-03 10:15:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 243 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 166 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 414ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/291 places, 12/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 556 ms. Remains : 7/291 places, 12/341 transitions.
[2025-06-03 10:15:42] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:15:42] [INFO ] Flatten gal took : 1 ms
[2025-06-03 10:15:42] [INFO ] Input system was already deterministic with 12 transitions.
[2025-06-03 10:15:42] [INFO ] Flatten gal took : 0 ms
[2025-06-03 10:15:42] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 207 steps (3 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 10:15:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14082707099796886584.gal : 0 ms
[2025-06-03 10:15:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17339548472941727500.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14082707099796886584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17339548472941727500.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 318
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 259 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 259 transition count 304
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 250 transition count 295
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 250 transition count 295
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 242 transition count 287
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 242 transition count 287
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 238 transition count 279
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 238 transition count 279
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 110 place count 234 transition count 275
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 234 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 230 transition count 271
Applied a total of 122 rules in 42 ms. Remains 230 /291 variables (removed 61) and now considering 271/341 (removed 70) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-03 10:15:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:15:42] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-03 10:15:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:15:43] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-03 10:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/501 variables, 230/232 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:57] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:57] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:57] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:57] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:57] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:58] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:59] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:15:59] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 13/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 245 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 515 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 230/291 places, 271/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 230/291 places, 271/341 transitions.
[2025-06-03 10:16:43] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:16:43] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:16:43] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-03 10:16:43] [INFO ] Flatten gal took : 31 ms
[2025-06-03 10:16:43] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:16:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1791169858775957391.gal : 2 ms
[2025-06-03 10:16:43] [INFO ] Time to serialize properties into /tmp/CTLFireability644896594424125792.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1791169858775957391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability644896594424125792.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:17:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 10:17:13] [INFO ] Applying decomposition
[2025-06-03 10:17:13] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6895900583901072234.txt' '-o' '/tmp/graph6895900583901072234.bin' '-w' '/tmp/graph6895900583901072234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6895900583901072234.bin' '-l' '-1' '-v' '-w' '/tmp/graph6895900583901072234.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:17:13] [INFO ] Decomposing Gal with order
[2025-06-03 10:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:17:13] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-03 10:17:13] [INFO ] Flatten gal took : 14 ms
[2025-06-03 10:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2025-06-03 10:17:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5204932780224984802.gal : 4 ms
[2025-06-03 10:17:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8670168497109448267.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5204932780224984802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8670168497109448267.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 318
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 256 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 256 transition count 301
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 245 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 245 transition count 290
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 234 transition count 277
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 234 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 227 transition count 265
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 227 transition count 265
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 135 place count 220 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 142 place count 220 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 215 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 215 transition count 253
Applied a total of 152 rules in 27 ms. Remains 215 /291 variables (removed 76) and now considering 253/341 (removed 88) transitions.
// Phase 1: matrix 253 rows 215 cols
[2025-06-03 10:17:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:17:44] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-03 10:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:17:44] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-03 10:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/468 variables, 215/217 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:56] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:56] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:56] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:56] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:57] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:57] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:57] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:57] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:57] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:58] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:58] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:58] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:17:58] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 9.0)
(t4 1.0)
(t5 29.0)
(t6 44.0)
(t7 1.0)
(t8 1.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 1.0)
(t20 1.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 1.0)
(t32 1.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 1.0)
(t44 1.0)
(t45 1.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 0.0)
(t56 1.0)
(t57 1.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 1.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 1.0)
(t81 1.0)
(t82 1.0)
(t83 1.0)
(t84 1.0)
(t85 0.0)
(t86 1.0)
(t87 1.0)
(t88 1.0)
(t89 0.0)
(t90 1.0)
(t91 0.0)
(t92 1.0)
(t93 1.0)
(t94 1.0)
(t95 1.0)
(t96 1.0)
(t97 0.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 0.0)
(t102 1.0)
(t103 0.0)
(t104 1.0)
(t105 1.0)
(t106 1.0)
(t107 1.0)
(t108 1.0)
(t109 0.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 0.0)
(t114 1.0)
(t115 0.0)
(t116 1.0)
(t117 1.0)
(t118 1.0)
(t119 1.0)
(t120 1.0)
(t121 0.0)
(t122 1.0)
(t123 1.0)
(t124 1.0)
(t125 0.0)
(t126 1.0)
(t127 0.0)
(t128 1.0)
(t129 1.0)
(t130 1.0)
(t131 1.0)
(t132 1.0)
(t133 0.0)
(t134 1.0)
(t135 1.0)
(t136 1.0)
(t137 0.0)
(t138 1.0)
(t139 0.0)
(t140 1.0)
(t141 1.0)
(t142 1.0)
(t143 1.0)
(t144 1.0)
(t145 0.0)
(t146 1.0)
(t147 1.0)
(t148 1.0)
(t149 1.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 1.0)
(t154 1.0)
(t155 1.0)
(t156 1.0)
(t157 0.0)
(t158 1.0)
(t159 1.0)
(t160 1.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 1.0)
(t167 0.0)
(t168 1.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 1.0)
(t173 1.0)
(t174 1.0)
(t175 0.0)
(t176 1.0)
(t177 1.0)
(t178 1.0)
(t179 1.0)
(t180 0.0)
(t181 1.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 1.0)
(t186 0.0)
(t187 1.0)
(t188 0.0)
(t189 1.0)
(t190 0.0)
(t191 1.0)
(t192 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 230 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/468 variables, 215/230 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 252/482 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 482 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 215/291 places, 253/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60499 ms. Remains : 215/291 places, 253/341 transitions.
[2025-06-03 10:18:44] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:18:44] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:18:44] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-03 10:18:44] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:18:44] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:18:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13725911609864953988.gal : 3 ms
[2025-06-03 10:18:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8535000478172534361.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13725911609864953988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8535000478172534361.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:19:14] [INFO ] Flatten gal took : 6 ms
[2025-06-03 10:19:14] [INFO ] Applying decomposition
[2025-06-03 10:19:14] [INFO ] Flatten gal took : 5 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/graph8390407930932898198.txt' '-o' '/tmp/graph8390407930932898198.bin' '-w' '/tmp/graph8390407930932898198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8390407930932898198.bin' '-l' '-1' '-v' '-w' '/tmp/graph8390407930932898198.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:19:14] [INFO ] Decomposing Gal with order
[2025-06-03 10:19:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:19:14] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 10:19:14] [INFO ] Flatten gal took : 30 ms
[2025-06-03 10:19:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2025-06-03 10:19:14] [INFO ] Time to serialize gal into /tmp/CTLFireability5115323307728641616.gal : 16 ms
[2025-06-03 10:19:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16331447004231952009.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5115323307728641616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16331447004231952009.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 316
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 255 transition count 301
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 255 transition count 301
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 244 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 244 transition count 290
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 105 place count 233 transition count 277
Iterating global reduction 0 with 11 rules applied. Total rules applied 116 place count 233 transition count 277
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 123 place count 226 transition count 265
Iterating global reduction 0 with 7 rules applied. Total rules applied 130 place count 226 transition count 265
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 219 transition count 258
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 219 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 149 place count 214 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 154 place count 214 transition count 253
Applied a total of 154 rules in 40 ms. Remains 214 /291 variables (removed 77) and now considering 253/341 (removed 88) transitions.
// Phase 1: matrix 253 rows 214 cols
[2025-06-03 10:19:44] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:19:44] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-03 10:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:19:45] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-03 10:19:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:57] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:57] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:57] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:58] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:58] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:58] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:58] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:58] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:59] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:59] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:59] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:59] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:19:59] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 229 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 481 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 214/291 places, 253/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60570 ms. Remains : 214/291 places, 253/341 transitions.
[2025-06-03 10:20:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:20:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:20:45] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-03 10:20:45] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:20:45] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:20:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14170320973053013955.gal : 3 ms
[2025-06-03 10:20:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16690709003800494619.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14170320973053013955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16690709003800494619.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:21:15] [INFO ] Flatten gal took : 6 ms
[2025-06-03 10:21:15] [INFO ] Applying decomposition
[2025-06-03 10:21:15] [INFO ] Flatten gal took : 6 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/graph10400939765338000932.txt' '-o' '/tmp/graph10400939765338000932.bin' '-w' '/tmp/graph10400939765338000932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10400939765338000932.bin' '-l' '-1' '-v' '-w' '/tmp/graph10400939765338000932.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:21:15] [INFO ] Decomposing Gal with order
[2025-06-03 10:21:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:21:15] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 10:21:15] [INFO ] Flatten gal took : 32 ms
[2025-06-03 10:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2025-06-03 10:21:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6128463944108348406.gal : 3 ms
[2025-06-03 10:21:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14276013431641859320.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6128463944108348406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14276013431641859320.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 268 transition count 318
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 268 transition count 318
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 258 transition count 304
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 258 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 248 transition count 294
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 248 transition count 294
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 240 transition count 286
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 240 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 237 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 237 transition count 280
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 234 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 234 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 117 place count 231 transition count 274
Iterating global reduction 0 with 3 rules applied. Total rules applied 120 place count 231 transition count 274
Applied a total of 120 rules in 23 ms. Remains 231 /291 variables (removed 60) and now considering 274/341 (removed 67) transitions.
// Phase 1: matrix 274 rows 231 cols
[2025-06-03 10:21:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:21:45] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 10:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:21:46] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-03 10:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 274/505 variables, 231/233 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:00] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:01] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:22:02] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 13/246 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 246 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/505 variables, 231/246 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 273/519 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 2)
(t4 1)
(t5 2)
(t6 28)
(t7 1)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 0)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 1)
(t19 1)
(t20 1)
(t21 1)
(t22 1)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 1)
(t55 1)
(t56 1)
(t57 1)
(t58 1)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 1)
(t98 1)
(t99 1)
(t100 1)
(t101 1)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 1)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 1)
(t137 1)
(t138 1)
(t139 1)
(t140 1)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 1)
(t149 1)
(t150 1)
(t151 1)
(t152 1)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 1)
(t171 0)
(t172 1)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 1)
(t180 1)
(t181 1)
(t182 2)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 1)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 1)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 519 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 231/291 places, 274/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 231/291 places, 274/341 transitions.
[2025-06-03 10:22:46] [INFO ] Flatten gal took : 11 ms
[2025-06-03 10:22:46] [INFO ] Flatten gal took : 15 ms
[2025-06-03 10:22:46] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-03 10:22:46] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:22:46] [INFO ] Flatten gal took : 10 ms
[2025-06-03 10:22:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15684542043511584233.gal : 3 ms
[2025-06-03 10:22:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1996654127704173869.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15684542043511584233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1996654127704173869.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:23:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 10:23:16] [INFO ] Applying decomposition
[2025-06-03 10:23:16] [INFO ] Flatten gal took : 6 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/graph1183003803111483942.txt' '-o' '/tmp/graph1183003803111483942.bin' '-w' '/tmp/graph1183003803111483942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1183003803111483942.bin' '-l' '-1' '-v' '-w' '/tmp/graph1183003803111483942.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:23:16] [INFO ] Decomposing Gal with order
[2025-06-03 10:23:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:23:16] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-03 10:23:16] [INFO ] Flatten gal took : 13 ms
[2025-06-03 10:23:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-03 10:23:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16532111758277257828.gal : 3 ms
[2025-06-03 10:23:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14654231141079146735.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16532111758277257828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14654231141079146735.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 341/341 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 266 transition count 316
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 266 transition count 316
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 255 transition count 300
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 255 transition count 300
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 244 transition count 289
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 244 transition count 289
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 105 place count 233 transition count 276
Iterating global reduction 0 with 11 rules applied. Total rules applied 116 place count 233 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 227 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 227 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 221 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 221 transition count 260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 144 place count 217 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 148 place count 217 transition count 256
Applied a total of 148 rules in 24 ms. Remains 217 /291 variables (removed 74) and now considering 256/341 (removed 85) transitions.
// Phase 1: matrix 256 rows 217 cols
[2025-06-03 10:23:46] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:23:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 10:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:23:46] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-06-03 10:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/473 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:59] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:59] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:59] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:23:59] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:00] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:01] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:24:01] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 13/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 232 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/473 variables, 217/232 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 255/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 487 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 217/291 places, 256/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 217/291 places, 256/341 transitions.
[2025-06-03 10:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:24:47] [INFO ] Input system was already deterministic with 256 transitions.
[2025-06-03 10:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:24:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2820251923289394093.gal : 2 ms
[2025-06-03 10:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13678264969360396793.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2820251923289394093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13678264969360396793.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:25:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 10:25:17] [INFO ] Applying decomposition
[2025-06-03 10:25:17] [INFO ] Flatten gal took : 6 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/graph16443950685360965665.txt' '-o' '/tmp/graph16443950685360965665.bin' '-w' '/tmp/graph16443950685360965665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16443950685360965665.bin' '-l' '-1' '-v' '-w' '/tmp/graph16443950685360965665.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:25:17] [INFO ] Decomposing Gal with order
[2025-06-03 10:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:25:17] [INFO ] Removed a total of 103 redundant transitions.
[2025-06-03 10:25:17] [INFO ] Flatten gal took : 18 ms
[2025-06-03 10:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2025-06-03 10:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7481693344349514911.gal : 3 ms
[2025-06-03 10:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7314909712905434235.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7481693344349514911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7314909712905434235.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:25:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 10:25:47] [INFO ] Flatten gal took : 8 ms
[2025-06-03 10:25:47] [INFO ] Applying decomposition
[2025-06-03 10:25:47] [INFO ] Flatten gal took : 8 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/graph7172057417057847876.txt' '-o' '/tmp/graph7172057417057847876.bin' '-w' '/tmp/graph7172057417057847876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7172057417057847876.bin' '-l' '-1' '-v' '-w' '/tmp/graph7172057417057847876.weights' '-q' '0' '-e' '0.001'
[2025-06-03 10:25:47] [INFO ] Decomposing Gal with order
[2025-06-03 10:25:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:25:47] [INFO ] Removed a total of 123 redundant transitions.
[2025-06-03 10:25:47] [INFO ] Flatten gal took : 15 ms
[2025-06-03 10:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 10:25:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16641678063861156967.gal : 4 ms
[2025-06-03 10:25:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10990696301481370195.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16641678063861156967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10990696301481370195.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 10:53:22] [INFO ] Applying decomposition
[2025-06-03 10:53:22] [INFO ] Flatten gal took : 221 ms
[2025-06-03 10:53:22] [INFO ] Decomposing Gal with order
[2025-06-03 10:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 10:53:23] [INFO ] Removed a total of 123 redundant transitions.
[2025-06-03 10:53:23] [INFO ] Flatten gal took : 376 ms
[2025-06-03 10:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 852 labels/synchronizations in 661 ms.
[2025-06-03 10:53:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7930532062450862051.gal : 36 ms
[2025-06-03 10:53:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9543791482848040847.ctl : 14 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7930532062450862051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9543791482848040847.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70599e+18,296.374,4245860,2931,4985,7.1076e+06,1.08996e+06,485,2.17197e+07,247,4.88866e+06,0
Converting to forward existential form...Done !
original formula: AG((((i0.i0.i0.i0.i0.i0.i0.u19.p175==0) + EG((AX((i0.i0.i0.i0.i0.i0.i0.u19.p194==1)) * (i0.i0.i0.i0.u22.p256==1)))) + !(A((i0.i0.i0.i0.i0...241
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(!(!((E(!(((i0.i0.i0.i0.i0.i0.i0.u19.p183==1)&&(i1.u28.p378==1))) U (!((i0.i0.i0.i0.i0.i0...444
Reverse transition relation is NOT exact ! Due to transitions t251, t256, t316, t324, t325, i0.t18, i0.t16, i0.u25.t19, i0.u25.t21, i0.u25.t331, i0.i0.t28,...2024
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DiscoveryGPU-PT-13b"
export BK_EXAMINATION="CTLFireability"
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 DiscoveryGPU-PT-13b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064700730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;