About the Execution of ITS-Tools for DES-PT-01b
| 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 | ?T?T?????????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-174854063800242.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 DES-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063800242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 68K 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 DES-PT-01b-CTLFireability-2023-12
FORMULA_NAME DES-PT-01b-CTLFireability-2023-13
FORMULA_NAME DES-PT-01b-CTLFireability-2023-14
FORMULA_NAME DES-PT-01b-CTLFireability-2023-15
FORMULA_NAME DES-PT-01b-CTLFireability-2025-00
FORMULA_NAME DES-PT-01b-CTLFireability-2025-01
FORMULA_NAME DES-PT-01b-CTLFireability-2025-02
FORMULA_NAME DES-PT-01b-CTLFireability-2025-03
FORMULA_NAME DES-PT-01b-CTLFireability-2025-04
FORMULA_NAME DES-PT-01b-CTLFireability-2025-05
FORMULA_NAME DES-PT-01b-CTLFireability-2025-06
FORMULA_NAME DES-PT-01b-CTLFireability-2025-07
FORMULA_NAME DES-PT-01b-CTLFireability-2025-08
FORMULA_NAME DES-PT-01b-CTLFireability-2025-09
FORMULA_NAME DES-PT-01b-CTLFireability-2025-10
FORMULA_NAME DES-PT-01b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748658912810
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 02:35:15] [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-05-31 02:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:35:15] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-05-31 02:35:15] [INFO ] Transformed 284 places.
[2025-05-31 02:35:15] [INFO ] Transformed 235 transitions.
[2025-05-31 02:35:15] [INFO ] Found NUPN structural information;
[2025-05-31 02:35:15] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 102 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 266 transition count 220
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 266 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 263 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 263 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 263 transition count 215
Applied a total of 41 rules in 150 ms. Remains 263 /284 variables (removed 21) and now considering 215/235 (removed 20) transitions.
// Phase 1: matrix 215 rows 263 cols
[2025-05-31 02:35:16] [INFO ] Computed 62 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:35:16] [INFO ] Implicit Places using invariants in 633 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 707 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/284 places, 215/235 transitions.
Applied a total of 0 rules in 9 ms. Remains 261 /261 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 261/284 places, 215/235 transitions.
Support contains 102 out of 261 places after structural reductions.
[2025-05-31 02:35:17] [INFO ] Flatten gal took : 75 ms
[2025-05-31 02:35:17] [INFO ] Flatten gal took : 26 ms
[2025-05-31 02:35:17] [INFO ] Input system was already deterministic with 215 transitions.
RANDOM walk for 40000 steps (384 resets) in 2701 ms. (14 steps per ms) remains 9/70 properties
BEST_FIRST walk for 40003 steps (65 resets) in 305 ms. (130 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (61 resets) in 216 ms. (184 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (63 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 117 ms. (339 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (66 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (62 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
// Phase 1: matrix 215 rows 261 cols
[2025-05-31 02:35:18] [INFO ] Computed 60 invariants in 11 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 155/177 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/180 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 58/238 variables, 24/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/244 variables, 3/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 203/447 variables, 244/304 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 21/468 variables, 13/317 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/472 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/474 variables, 1/320 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/476 variables, 1/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/476 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 321 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 158/175 variables, 31/31 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 7 ms to minimize.
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 4/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/180 variables, 2/37 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 6 (OVERLAPS) 58/238 variables, 24/61 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 4/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/244 variables, 3/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 203/447 variables, 244/312 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:21] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 1/313 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/313 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp38 is UNSAT
After SMT solving in domain Int declared 468/476 variables, and 326 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 257/261 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2657ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2025-05-31 02:35:21] [INFO ] Flatten gal took : 37 ms
[2025-05-31 02:35:21] [INFO ] Flatten gal took : 31 ms
[2025-05-31 02:35:21] [INFO ] Input system was already deterministic with 215 transitions.
Computed a total of 53 stabilizing places and 49 stable transitions
Graph (complete) has 470 edges and 261 vertex of which 254 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 249 transition count 203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 249 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 249 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 243 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 243 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 44 place count 243 transition count 189
Applied a total of 44 rules in 41 ms. Remains 243 /261 variables (removed 18) and now considering 189/215 (removed 26) transitions.
// Phase 1: matrix 189 rows 243 cols
[2025-05-31 02:35:21] [INFO ] Computed 60 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:35:21] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-05-31 02:35:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:35:22] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2025-05-31 02:35: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/242 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:29] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:29] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:29] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:29] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:29] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:30] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:31] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:31] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:31] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:31] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:32] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:32] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:33] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:34] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 189/432 variables, 243/339 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:39] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:39] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:39] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:40] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:41] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:41] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:47] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:51] [INFO ] Deduced a trap along path composed of 5 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:52] [INFO ] Deduced a trap along path composed of 4 places in 50 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 359 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:54] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:54] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:54] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 189/432 variables, 243/361 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 188/549 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:57] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:35:59] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:00] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:07] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:12] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:36:13] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 188 unsolved
SMT process timed out in 60144ms, After SMT, problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 243/261 places, 189/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61008 ms. Remains : 243/261 places, 189/215 transitions.
[2025-05-31 02:36:22] [INFO ] Flatten gal took : 23 ms
[2025-05-31 02:36:22] [INFO ] Flatten gal took : 23 ms
[2025-05-31 02:36:22] [INFO ] Input system was already deterministic with 189 transitions.
[2025-05-31 02:36:22] [INFO ] Flatten gal took : 23 ms
[2025-05-31 02:36:22] [INFO ] Flatten gal took : 23 ms
[2025-05-31 02:36:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3353253984793398628.gal : 12 ms
[2025-05-31 02:36:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12789986504382848051.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3353253984793398628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12789986504382848051.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,7.10768e+15,28.0766,671624,2,417460,5,2.58395e+06,6,0,1161,2.72882e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 02:36:52] [INFO ] Flatten gal took : 20 ms
[2025-05-31 02:36:52] [INFO ] Applying decomposition
[2025-05-31 02:36:52] [INFO ] Flatten gal took : 20 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/graph6979362104314519138.txt' '-o' '/tmp/graph6979362104314519138.bin' '-w' '/tmp/graph6979362104314519138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6979362104314519138.bin' '-l' '-1' '-v' '-w' '/tmp/graph6979362104314519138.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:36:53] [INFO ] Decomposing Gal with order
[2025-05-31 02:36:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:36:53] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 02:36:53] [INFO ] Flatten gal took : 72 ms
[2025-05-31 02:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-05-31 02:36:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18019311879697086197.gal : 9 ms
[2025-05-31 02:36:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12407225062665878116.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/CTLFireability18019311879697086197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12407225062665878116.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.
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,7.10768e+15,0.41315,16328,2133,62,30692,715,617,36055,85,2357,0
Converting to forward existential form...Done !
original formula: (A((!(AX(!(AF((i1.u6.p17==1))))) * ((!(((i5.u28.p94!=1) * AF((i2.u8.p26==1)))) + (((i10.i0.i0.u52.p181==1)||(i6.u33.p121==1)) * AF(((i12....717
=> equivalent forward existential formula: (([FwdG((FwdU((Init * !(!((E(!(EG((!(((i6.u32.p113==1)||((i10.i1.i0.u44.p161==1)&&(i2.u7.p18==1)))) * !((E(TRUE ...3821
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t89, t138, t181, i0.u36.t79, i0.u80.t17, i1.u14.t115, i1.u16.t112, i2.t126, i2.u8.t1...724
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 39 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 02:37:23] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:37:23] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-05-31 02:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:37:24] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 02:37:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:30] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:30] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:30] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:31] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:31] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:31] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:31] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:31] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:32] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:33] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:34] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:34] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:34] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:35] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:35] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:36] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:36] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:36] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:36] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:37] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:38] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:43] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:43] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:44] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:45] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:49] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:49] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 356 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:57] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:58] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:59] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:59] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:37:59] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:00] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:00] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 177/541 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:07] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:11] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:11] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:11] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:11] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 5/546 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:38:23] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 547 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61166 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 02:38:24] [INFO ] Flatten gal took : 16 ms
[2025-05-31 02:38:24] [INFO ] Flatten gal took : 16 ms
[2025-05-31 02:38:24] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 02:38:24] [INFO ] Flatten gal took : 14 ms
[2025-05-31 02:38:24] [INFO ] Flatten gal took : 14 ms
[2025-05-31 02:38:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17256526587230419847.gal : 3 ms
[2025-05-31 02:38:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10201564087768274059.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/CTLFireability17256526587230419847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10201564087768274059.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.
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,3.71666e+15,28.6701,667324,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 02:38:54] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:38:54] [INFO ] Applying decomposition
[2025-05-31 02:38:54] [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/graph7430358294846845331.txt' '-o' '/tmp/graph7430358294846845331.bin' '-w' '/tmp/graph7430358294846845331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7430358294846845331.bin' '-l' '-1' '-v' '-w' '/tmp/graph7430358294846845331.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:38:54] [INFO ] Decomposing Gal with order
[2025-05-31 02:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:38:54] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 02:38:54] [INFO ] Flatten gal took : 22 ms
[2025-05-31 02:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2025-05-31 02:38:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8419059584852028321.gal : 7 ms
[2025-05-31 02:38:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4434100582223732999.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/CTLFireability8419059584852028321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4434100582223732999.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.
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,3.71666e+15,0.565574,20240,2580,78,36101,537,696,67448,84,1632,0
Converting to forward existential form...Done !
original formula: EG((!(E((i12.i0.u68.p250==1) U EX(EF((i8.i2.u53.p198==1))))) * !(E(AX(((i11.i1.u39.p176==1)&&(i10.i1.u56.p208==1))) U AF(AX((i12.i1.u74.p...168
=> equivalent forward existential formula: [FwdG(Init,(!(E((i12.i0.u68.p250==1) U EX(E(TRUE U (i8.i2.u53.p198==1))))) * !(E(!(EX(!(((i11.i1.u39.p176==1)&&(...235
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t87, t131, t172, i0.i0.u30.t79, i1.t119, i1.u7.t124, i1.u7.t125, i1.u8.t121, i1...749
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 246 transition count 200
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 246 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 246 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 238 transition count 188
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 238 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 238 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 237 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 237 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 237 transition count 180
Applied a total of 59 rules in 29 ms. Remains 237 /261 variables (removed 24) and now considering 180/215 (removed 35) transitions.
// Phase 1: matrix 180 rows 237 cols
[2025-05-31 02:39:24] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:39:25] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-05-31 02:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:39:25] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-31 02:39:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:30] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:31] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:32] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:32] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:33] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:34] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:35] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:36] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:36] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:38] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 180/417 variables, 237/339 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:45] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:45] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:46] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:47] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:48] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:50] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:50] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:51] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:51] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 355 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 58/118 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:58] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:39:58] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:00] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:01] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 180/417 variables, 237/359 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 179/538 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:08] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:08] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:08] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:15] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 542 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 237/261 places, 180/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60845 ms. Remains : 237/261 places, 180/215 transitions.
[2025-05-31 02:40:25] [INFO ] Flatten gal took : 13 ms
[2025-05-31 02:40:25] [INFO ] Flatten gal took : 12 ms
[2025-05-31 02:40:25] [INFO ] Input system was already deterministic with 180 transitions.
[2025-05-31 02:40:25] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:40:25] [INFO ] Flatten gal took : 13 ms
[2025-05-31 02:40:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17839085640635075611.gal : 4 ms
[2025-05-31 02:40:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9266723475395491718.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/CTLFireability17839085640635075611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9266723475395491718.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-05-31 02:40:55] [INFO ] Flatten gal took : 20 ms
[2025-05-31 02:40:55] [INFO ] Applying decomposition
[2025-05-31 02:40:55] [INFO ] Flatten gal took : 13 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/graph3179125932404310734.txt' '-o' '/tmp/graph3179125932404310734.bin' '-w' '/tmp/graph3179125932404310734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3179125932404310734.bin' '-l' '-1' '-v' '-w' '/tmp/graph3179125932404310734.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:40:55] [INFO ] Decomposing Gal with order
[2025-05-31 02:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:40:56] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 02:40:56] [INFO ] Flatten gal took : 32 ms
[2025-05-31 02:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2025-05-31 02:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14577654337083216028.gal : 7 ms
[2025-05-31 02:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8469444910991497289.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/CTLFireability14577654337083216028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8469444910991497289.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.
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.06287e+15,0.603907,19604,3012,72,40711,407,601,44169,86,1150,0
Converting to forward existential form...Done !
original formula: EG((!(A((((i3.u6.p23==1)&&(i3.u19.p79==1)) + AX((i6.u38.p151==1))) U !(((i3.u6.p25==1)&&(i3.u19.p79==1))))) + AF(EX((i11.u67.p247==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(!((E(!(!(((i3.u6.p25==1)&&(i3.u19.p79==1)))) U (!((((i3.u6.p23==1)&&(i3.u19.p79==1)) + !(EX(!((i6....311
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t62, t87, t99, t119, i0.u11.t112, i0.u13.t109, i0.u7.t121, i0.u7.t122, i1.u76.t17, i...699
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 247 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 247 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 247 transition count 196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 241 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 241 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 241 transition count 186
Applied a total of 49 rules in 12 ms. Remains 241 /261 variables (removed 20) and now considering 186/215 (removed 29) transitions.
// Phase 1: matrix 186 rows 241 cols
[2025-05-31 02:41:26] [INFO ] Computed 60 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:41:26] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-31 02:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:41:26] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-05-31 02:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:32] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:33] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:33] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:33] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:34] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:34] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:34] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:35] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:36] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:40] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:41] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:41] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 186/427 variables, 241/343 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:47] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:47] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:48] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:48] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:48] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:54] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:54] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:41:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/427 variables, and 353 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/427 variables, 241/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 185/538 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:03] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:03] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:03] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:03] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:04] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:04] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:06] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:42:06] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 9/547 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 547 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 241/261 places, 186/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60712 ms. Remains : 241/261 places, 186/215 transitions.
[2025-05-31 02:42:26] [INFO ] Flatten gal took : 12 ms
[2025-05-31 02:42:26] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:42:26] [INFO ] Input system was already deterministic with 186 transitions.
[2025-05-31 02:42:26] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:42:26] [INFO ] Flatten gal took : 10 ms
[2025-05-31 02:42:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5687683676085310511.gal : 3 ms
[2025-05-31 02:42:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13115032005449285627.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/CTLFireability5687683676085310511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13115032005449285627.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-05-31 02:42:57] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:42:57] [INFO ] Applying decomposition
[2025-05-31 02:42:57] [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/graph5202750888615029889.txt' '-o' '/tmp/graph5202750888615029889.bin' '-w' '/tmp/graph5202750888615029889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5202750888615029889.bin' '-l' '-1' '-v' '-w' '/tmp/graph5202750888615029889.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:42:57] [INFO ] Decomposing Gal with order
[2025-05-31 02:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:42:57] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 02:42:57] [INFO ] Flatten gal took : 48 ms
[2025-05-31 02:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-31 02:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2485280166848992070.gal : 4 ms
[2025-05-31 02:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability8448760479006439483.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/CTLFireability2485280166848992070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8448760479006439483.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.
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,7.88072e+15,0.4832,19072,2336,72,35302,774,698,54760,85,2224,0
Converting to forward existential form...Done !
original formula: EF((AX((EX((i6.i0.u36.p142==0)) * AG((i12.u77.p279==0)))) * (EG(((i2.u10.p44==1)||(i3.u13.p52==1))) + ((i7.i1.u67.p252==0) * (AG((i5.i0.u...192
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(EX(!((EX((i6.i0.u36.p142==0)) * !(E(TRUE U !((i12.u77.p279==0))))))))),((i2.u10.p44=...510
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t137, t180, i0.i0.u32.t79, i0.i2.u15.t109, i1.t125, i1.u7.t130, i1.u7.t131...772
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 17 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 02:43:27] [INFO ] Computed 60 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:43:27] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-31 02:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:43:27] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 02:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:34] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:34] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:34] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:34] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:34] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:35] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:37] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:37] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:37] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:38] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:38] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:38] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:38] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:39] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:39] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:40] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:41] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:42] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:42] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:42] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:42] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:47] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:47] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:48] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:49] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:53] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:53] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:53] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:56] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:43:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 356 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:00] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:01] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:02] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:02] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:03] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 177/541 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:11] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:15] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:15] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:15] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:15] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 5/546 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:44:28] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 11 ms to minimize.
SMT process timed out in 60071ms, After SMT, problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60839 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 02:44:28] [INFO ] Flatten gal took : 12 ms
[2025-05-31 02:44:28] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:44:28] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 02:44:28] [INFO ] Flatten gal took : 8 ms
[2025-05-31 02:44:28] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:44:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11152323473292310456.gal : 2 ms
[2025-05-31 02:44:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14280782413974802358.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/CTLFireability11152323473292310456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14280782413974802358.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.
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,3.71666e+15,29.0247,668824,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 02:44:58] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:44:58] [INFO ] Applying decomposition
[2025-05-31 02:44:58] [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/graph7226973245987519422.txt' '-o' '/tmp/graph7226973245987519422.bin' '-w' '/tmp/graph7226973245987519422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7226973245987519422.bin' '-l' '-1' '-v' '-w' '/tmp/graph7226973245987519422.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:44:58] [INFO ] Decomposing Gal with order
[2025-05-31 02:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:44:58] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 02:44:58] [INFO ] Flatten gal took : 14 ms
[2025-05-31 02:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 21 ms.
[2025-05-31 02:44:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12871436010533047627.gal : 3 ms
[2025-05-31 02:44:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17936162023143151724.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/CTLFireability12871436010533047627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17936162023143151724.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.
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,3.71666e+15,0.765602,22428,2470,82,40277,638,677,79051,85,1869,0
Converting to forward existential form...Done !
original formula: E((AF((i12.i2.u72.p273==1)) * AX(E((i9.i0.u54.p207==1) U !(EF(((i8.i0.u41.p164==1)&&(i8.i0.u48.p190==1))))))) U EF((i11.i1.u12.p58==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(EG(!((i12.i2.u72.p273==1)))) * !(EX(!(E((i9.i0.u54.p207==1) U !(E(TRUE U ((i8.i0.u41.p164==1...225
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t58, t87, t131, t172, i0.u74.t17, i1.i1.u29.t79, i1.i2.u13.t109, i2.t119, i2.u6.t124...744
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 246 transition count 200
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 246 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 246 transition count 196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 240 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 240 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 240 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 239 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 239 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 239 transition count 184
Applied a total of 53 rules in 14 ms. Remains 239 /261 variables (removed 22) and now considering 184/215 (removed 31) transitions.
// Phase 1: matrix 184 rows 239 cols
[2025-05-31 02:45:28] [INFO ] Computed 60 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:45:28] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-05-31 02:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:45:29] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-05-31 02:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:34] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:36] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:37] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:37] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:37] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:37] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:38] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:39] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:40] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 184/423 variables, 239/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:46] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:47] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:47] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:48] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:48] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:54] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:56] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:56] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:56] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:45:56] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 352 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 53/113 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:01] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:01] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:01] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:02] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:02] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:02] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 184/423 variables, 239/359 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 183/542 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:46:09] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 544 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 239/261 places, 184/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60776 ms. Remains : 239/261 places, 184/215 transitions.
[2025-05-31 02:46:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:46:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:46:29] [INFO ] Input system was already deterministic with 184 transitions.
[2025-05-31 02:46:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:46:29] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:46:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2558060926031050291.gal : 2 ms
[2025-05-31 02:46:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8653851202889417343.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/CTLFireability2558060926031050291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8653851202889417343.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-05-31 02:46:59] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:46:59] [INFO ] Applying decomposition
[2025-05-31 02:46:59] [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/graph2546391667584788742.txt' '-o' '/tmp/graph2546391667584788742.bin' '-w' '/tmp/graph2546391667584788742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2546391667584788742.bin' '-l' '-1' '-v' '-w' '/tmp/graph2546391667584788742.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:46:59] [INFO ] Decomposing Gal with order
[2025-05-31 02:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:46:59] [INFO ] Removed a total of 17 redundant transitions.
[2025-05-31 02:46:59] [INFO ] Flatten gal took : 13 ms
[2025-05-31 02:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2025-05-31 02:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1094076868108269120.gal : 4 ms
[2025-05-31 02:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2099706856871048848.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/CTLFireability1094076868108269120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2099706856871048848.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.
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,5.95745e+15,0.459868,17320,2674,65,33228,507,661,37036,84,1608,0
Converting to forward existential form...Done !
original formula: (EF(((i7.i1.u55.p200==0)||(i7.i1.u65.p229==0))) * !(A((!(((i10.i0.u36.p146==1)&&(i8.i1.u40.p155==1))) + (!((!(((i9.i0.u44.p164==1)&&(i9.i...399
=> equivalent forward existential formula: ([(EY((FwdU((Init * E(TRUE U ((i7.i1.u55.p200==0)||(i7.i1.u65.p229==0)))),!(!(EX(!(EX((((i11.u67.p260==1)&&(i11....739
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t52, t58, t88, t100, t121, t134, t177, i0.i0.u31.t79, i1.i0.u12.t114, i1.i1.u8.t123,...711
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 238 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 238 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 238 transition count 182
Applied a total of 56 rules in 10 ms. Remains 238 /261 variables (removed 23) and now considering 182/215 (removed 33) transitions.
// Phase 1: matrix 182 rows 238 cols
[2025-05-31 02:47:29] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:47:29] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-31 02:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:47:29] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-31 02:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:35] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:36] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:37] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:38] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:38] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:40] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:42] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/420 variables, 238/331 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:47] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:48] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:49] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:50] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:50] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:51] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 17/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:55] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:47:57] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 14/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 362 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 64/124 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:02] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 182/420 variables, 238/363 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 181/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:14] [INFO ] Deduced a trap along path composed of 4 places in 135 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:15] [INFO ] Deduced a trap along path composed of 8 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:16] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:16] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:48:21] [INFO ] Deduced a trap along path composed of 4 places in 48 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 5/549 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 549 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 182/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 238/261 places, 182/215 transitions.
[2025-05-31 02:48:30] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:48:30] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:48:30] [INFO ] Input system was already deterministic with 182 transitions.
[2025-05-31 02:48:30] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:48:30] [INFO ] Flatten gal took : 20 ms
[2025-05-31 02:48:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15833830588386044743.gal : 14 ms
[2025-05-31 02:48:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4836347291087631823.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/CTLFireability15833830588386044743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4836347291087631823.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,5.00137e+15,28.5759,667968,2,416108,5,2.57895e+06,6,0,1135,2.72406e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 02:49:00] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:49:00] [INFO ] Applying decomposition
[2025-05-31 02:49:00] [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/graph16494421036579794801.txt' '-o' '/tmp/graph16494421036579794801.bin' '-w' '/tmp/graph16494421036579794801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16494421036579794801.bin' '-l' '-1' '-v' '-w' '/tmp/graph16494421036579794801.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:49:00] [INFO ] Decomposing Gal with order
[2025-05-31 02:49:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:49:00] [INFO ] Removed a total of 13 redundant transitions.
[2025-05-31 02:49:00] [INFO ] Flatten gal took : 19 ms
[2025-05-31 02:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 21 ms.
[2025-05-31 02:49:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12136879587060193082.gal : 12 ms
[2025-05-31 02:49:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8790656059340114652.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/CTLFireability12136879587060193082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8790656059340114652.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.
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,5.00137e+15,0.635431,22572,4377,78,48365,406,680,51587,86,1172,0
Converting to forward existential form...Done !
original formula: !(A(EX(TRUE) U ((EG(!((AX((i8.i1.u41.p158==1)) * AX((i7.i1.u43.p161==1))))) * (i2.u9.p45==1)) * (i2.u29.p126==1))))
=> equivalent forward existential formula: ((([((FwdU(Init,!(((EG(!((!(EX(!((i8.i1.u41.p158==1)))) * !(EX(!((i7.i1.u43.p161==1))))))) * (i2.u9.p45==1)) * (...770
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t56, t87, t134, t176, i0.i1.u30.t79, i0.i2.u73.t17, i1.t122, i1.u6.t127, i1.u6.t128,...747
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 13 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 02:49:30] [INFO ] Computed 60 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:49:30] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-31 02:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:49:30] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 02:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:36] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:36] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:36] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:36] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:36] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:37] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:38] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:39] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:39] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:39] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:40] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:40] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:40] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:41] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:41] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:42] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:43] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:44] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:48] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:48] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:49] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:49] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:50] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:54] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:54] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:55] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:57] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:49:57] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:00] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 357 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 61/121 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:03] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:03] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:04] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:06] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:07] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:07] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:09] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 178/414 variables, 236/366 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 177/543 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:15] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:17] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:17] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:18] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/548 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:50:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 550 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60645 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 02:50:31] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:50:31] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:50:31] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 02:50:31] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:50:31] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:50:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16959806436481330408.gal : 1 ms
[2025-05-31 02:50:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14626624668017592308.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/CTLFireability16959806436481330408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14626624668017592308.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-05-31 02:51:01] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:51:01] [INFO ] Applying decomposition
[2025-05-31 02:51:01] [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/graph16051933991259415681.txt' '-o' '/tmp/graph16051933991259415681.bin' '-w' '/tmp/graph16051933991259415681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16051933991259415681.bin' '-l' '-1' '-v' '-w' '/tmp/graph16051933991259415681.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:51:01] [INFO ] Decomposing Gal with order
[2025-05-31 02:51:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:51:01] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 02:51:01] [INFO ] Flatten gal took : 12 ms
[2025-05-31 02:51:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-31 02:51:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10563717687480277374.gal : 19 ms
[2025-05-31 02:51:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5118162284289511056.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/CTLFireability10563717687480277374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5118162284289511056.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.
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,3.71666e+15,0.825247,23268,3122,73,46677,863,574,74465,83,2517,0
Converting to forward existential form...Done !
original formula: AG((EX(TRUE) + EG((i10.u12.p58==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG((i10.u12.p58==0)))) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t54, t87, t131, t172, i0.u30.t79, i0.u74.t17, i1.u9.t115, i2.t119, i2.u6.t124, i2.u6...708
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 12 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
[2025-05-31 02:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:51:31] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-05-31 02:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:51:31] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 02:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:37] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:38] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:40] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:41] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:41] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:41] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:42] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:43] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:47] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:48] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:48] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:48] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:49] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:52] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:52] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:54] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:51:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 62/122 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:04] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:05] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:05] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:06] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:06] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/364 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/541 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:14] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:14] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:52:19] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 544 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 02:52:32] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:52:32] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:52:32] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 02:52:32] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:52:32] [INFO ] Flatten gal took : 16 ms
[2025-05-31 02:52:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3071837662327062036.gal : 2 ms
[2025-05-31 02:52:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17514584316853281153.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/CTLFireability3071837662327062036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17514584316853281153.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-05-31 02:53:02] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:53:02] [INFO ] Applying decomposition
[2025-05-31 02:53:02] [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/graph9183152038934515204.txt' '-o' '/tmp/graph9183152038934515204.bin' '-w' '/tmp/graph9183152038934515204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9183152038934515204.bin' '-l' '-1' '-v' '-w' '/tmp/graph9183152038934515204.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:53:02] [INFO ] Decomposing Gal with order
[2025-05-31 02:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:53:02] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 02:53:02] [INFO ] Flatten gal took : 29 ms
[2025-05-31 02:53:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-31 02:53:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7071010280121636170.gal : 5 ms
[2025-05-31 02:53:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17920835954570420892.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/CTLFireability7071010280121636170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17920835954570420892.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.
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,3.71666e+15,0.816667,26036,4560,76,56335,486,660,56431,84,1224,0
Converting to forward existential form...Done !
original formula: EX(!(E(EX(EG((i6.i1.u5.p131==1))) U ((i5.u30.p110==1) * AG((i8.i2.u61.p216==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(EG((i6.i1.u5.p131==1))) U ((i5.u30.p110==1) * !(E(TRUE U !((i8.i2.u61.p216==1))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t91, t119, t131, t172, i0.i1.u33.t79, i1.u10.t121, i1.u10.t122, i1.u14.t11...714
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Graph (complete) has 470 edges and 261 vertex of which 254 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 253 transition count 190
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 234 transition count 190
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 39 place count 234 transition count 180
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 224 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 72 place count 211 transition count 167
Iterating global reduction 2 with 13 rules applied. Total rules applied 85 place count 211 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 211 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 210 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 92 place count 210 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 209 transition count 160
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 100 place count 203 transition count 154
Iterating global reduction 4 with 6 rules applied. Total rules applied 106 place count 203 transition count 154
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 with 7 rules applied. Total rules applied 113 place count 203 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 115 place count 202 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 115 place count 202 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 121 place count 199 transition count 143
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 251 place count 134 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 253 place count 132 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 255 place count 130 transition count 76
Applied a total of 255 rules in 74 ms. Remains 130 /261 variables (removed 131) and now considering 76/215 (removed 139) transitions.
// Phase 1: matrix 76 rows 130 cols
[2025-05-31 02:53:32] [INFO ] Computed 56 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:32] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 02:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:32] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [9, 35, 39, 43, 47, 49, 51, 53, 55, 57, 59, 61, 79, 102, 125]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 517 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 115/261 places, 76/215 transitions.
Graph (complete) has 244 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 111 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 108 transition count 70
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 31 place count 96 transition count 58
Applied a total of 31 rules in 18 ms. Remains 96 /115 variables (removed 19) and now considering 58/76 (removed 18) transitions.
// Phase 1: matrix 58 rows 96 cols
[2025-05-31 02:53:32] [INFO ] Computed 40 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:33] [INFO ] Implicit Places using invariants in 114 ms returned [55, 71, 74, 81, 84]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 125 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 91/261 places, 58/215 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 91 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 54
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 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 53
Applied a total of 8 rules in 10 ms. Remains 87 /91 variables (removed 4) and now considering 53/58 (removed 5) transitions.
// Phase 1: matrix 53 rows 87 cols
[2025-05-31 02:53:33] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:33] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-31 02:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-31 02:53:33] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 87/261 places, 53/215 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 974 ms. Remains : 87/261 places, 53/215 transitions.
[2025-05-31 02:53:33] [INFO ] Flatten gal took : 2 ms
[2025-05-31 02:53:33] [INFO ] Flatten gal took : 3 ms
[2025-05-31 02:53:33] [INFO ] Input system was already deterministic with 53 transitions.
[2025-05-31 02:53:33] [INFO ] Flatten gal took : 3 ms
[2025-05-31 02:53:33] [INFO ] Flatten gal took : 3 ms
[2025-05-31 02:53:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9161439982118425253.gal : 1 ms
[2025-05-31 02:53:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16929948285897933972.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/ReachabilityCardinality9161439982118425253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16929948285897933972.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 3174 steps (174 resets) in 39 ms. (79 steps per ms) remains 0/1 properties
FORMULA DES-PT-01b-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 247 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 247 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 247 transition count 196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 241 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 241 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 241 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 240 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 240 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 240 transition count 183
Applied a total of 53 rules in 15 ms. Remains 240 /261 variables (removed 21) and now considering 183/215 (removed 32) transitions.
// Phase 1: matrix 183 rows 240 cols
[2025-05-31 02:53:33] [INFO ] Computed 60 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:33] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-31 02:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:53:33] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-05-31 02:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:39] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:40] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:41] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:42] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:42] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:42] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:42] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:43] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:44] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:44] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:44] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:44] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/99 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:45] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:50] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 183/423 variables, 240/342 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:55] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:56] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:57] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:58] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:58] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:53:59] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:02] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 356 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 56/116 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:05] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/423 variables, 240/357 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 182/539 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:10] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:10] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:54:11] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 543 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60039ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 60040ms
Starting structural reductions in LTL mode, iteration 1 : 240/261 places, 183/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60616 ms. Remains : 240/261 places, 183/215 transitions.
[2025-05-31 02:54:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 02:54:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 02:54:34] [INFO ] Input system was already deterministic with 183 transitions.
[2025-05-31 02:54:34] [INFO ] Flatten gal took : 9 ms
[2025-05-31 02:54:34] [INFO ] Flatten gal took : 8 ms
[2025-05-31 02:54:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1711454670371432403.gal : 3 ms
[2025-05-31 02:54:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1865323987142491691.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/CTLFireability1711454670371432403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1865323987142491691.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-05-31 02:55:04] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:55:04] [INFO ] Applying decomposition
[2025-05-31 02:55:04] [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/graph13259442271615945776.txt' '-o' '/tmp/graph13259442271615945776.bin' '-w' '/tmp/graph13259442271615945776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13259442271615945776.bin' '-l' '-1' '-v' '-w' '/tmp/graph13259442271615945776.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:55:04] [INFO ] Decomposing Gal with order
[2025-05-31 02:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:55:04] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 02:55:04] [INFO ] Flatten gal took : 20 ms
[2025-05-31 02:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-31 02:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16513424162224091715.gal : 32 ms
[2025-05-31 02:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability515741833955524777.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/CTLFireability16513424162224091715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability515741833955524777.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.
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,5.61771e+15,0.557655,17828,3079,70,34218,556,663,40436,88,1799,0
Converting to forward existential form...Done !
original formula: (EX(((i3.u25.p96==1) + EG(AF((i4.u28.p121==0))))) + EX(AX((EG((i5.u69.p254==0)) * (i0.u13.p60==0)))))
=> equivalent forward existential formula: (([(EY(Init) * (i3.u25.p96==1))] != FALSE + [FwdG(EY(Init),!(EG(!((i4.u28.p121==0)))))] != FALSE) + [(EY(Init) *...218
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t134, t176, i0.u13.t110, i0.u13.t112, i1.t122, i1.u6.t127, i1.u6.t128, i1.u7.t1...740
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 247 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 247 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 247 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 241 transition count 191
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 241 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 48 place count 241 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 240 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 240 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 240 transition count 185
Applied a total of 51 rules in 15 ms. Remains 240 /261 variables (removed 21) and now considering 185/215 (removed 30) transitions.
// Phase 1: matrix 185 rows 240 cols
[2025-05-31 02:55:34] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:34] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-31 02:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:34] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-05-31 02:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:40] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:41] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:41] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:41] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:41] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:41] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:42] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:43] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:44] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:45] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:46] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:46] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:46] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:49] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:49] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:49] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 185/425 variables, 240/340 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:56] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:56] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:56] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:56] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:57] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:57] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:57] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:58] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:58] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 11/351 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:00] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/425 variables, and 354 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 54/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/425 variables, 240/354 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 184/538 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:10] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:11] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:12] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:12] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:12] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:13] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 6/544 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:56:28] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 545 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 240/261 places, 185/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60699 ms. Remains : 240/261 places, 185/215 transitions.
[2025-05-31 02:56:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:56:35] [INFO ] Flatten gal took : 6 ms
[2025-05-31 02:56:35] [INFO ] Input system was already deterministic with 185 transitions.
[2025-05-31 02:56:35] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:56:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:56:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10798358478245383601.gal : 2 ms
[2025-05-31 02:56:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17567303064284161915.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/CTLFireability10798358478245383601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17567303064284161915.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-05-31 02:57:05] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:57:05] [INFO ] Applying decomposition
[2025-05-31 02:57:05] [INFO ] Flatten gal took : 4 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/graph1879005463963785933.txt' '-o' '/tmp/graph1879005463963785933.bin' '-w' '/tmp/graph1879005463963785933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1879005463963785933.bin' '-l' '-1' '-v' '-w' '/tmp/graph1879005463963785933.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:57:05] [INFO ] Decomposing Gal with order
[2025-05-31 02:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:57:05] [INFO ] Removed a total of 17 redundant transitions.
[2025-05-31 02:57:05] [INFO ] Flatten gal took : 12 ms
[2025-05-31 02:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-05-31 02:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15904376353658508680.gal : 3 ms
[2025-05-31 02:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10366694059781119209.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/CTLFireability15904376353658508680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10366694059781119209.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.
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,7.40789e+15,1.13981,29604,2701,71,48989,529,682,154224,82,1540,0
Converting to forward existential form...Done !
original formula: A(((i1.u4.p14==1)||(i12.i0.u0.p0==1)) U A(AX((!(((i11.i0.u15.p63==1)&&(i11.i1.u73.p263==1))) * AF((i2.u7.p26==1)))) U (EG(!(EF((i5.u28.p1...258
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG(!(E(TRUE U (i5.u28.p115==1)))) * EG(((i4.i1.u26.p101==1)&&((i1.u4.p72==1)||((i11.i0....1630
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t135, t178, i0.u33.t76, i1.u12.t116, i2.t123, i2.u7.t128, i2.u7.t129, i2.u8.t12...765
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 238 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 238 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 238 transition count 182
Applied a total of 56 rules in 12 ms. Remains 238 /261 variables (removed 23) and now considering 182/215 (removed 33) transitions.
// Phase 1: matrix 182 rows 238 cols
[2025-05-31 02:57:35] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:57:35] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 02:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:57:35] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-31 02:57:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:41] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:42] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:43] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:44] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 182/420 variables, 238/336 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:51] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:51] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:52] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:52] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:53] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:53] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:53] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 8/344 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:57:58] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:03] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 347 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 48/108 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:06] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 182/420 variables, 238/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 181/538 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:11] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:11] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:12] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:13] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:13] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:58:14] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 6/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
SMT process timed out in 60036ms, After SMT, problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 182/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 238/261 places, 182/215 transitions.
[2025-05-31 02:58:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:58:35] [INFO ] Flatten gal took : 8 ms
[2025-05-31 02:58:35] [INFO ] Input system was already deterministic with 182 transitions.
[2025-05-31 02:58:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:58:35] [INFO ] Flatten gal took : 7 ms
[2025-05-31 02:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17296042976981091940.gal : 2 ms
[2025-05-31 02:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5641387560665442301.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/CTLFireability17296042976981091940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5641387560665442301.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-05-31 02:59:06] [INFO ] Flatten gal took : 5 ms
[2025-05-31 02:59:06] [INFO ] Applying decomposition
[2025-05-31 02:59:06] [INFO ] Flatten gal took : 4 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/graph4591009893730206870.txt' '-o' '/tmp/graph4591009893730206870.bin' '-w' '/tmp/graph4591009893730206870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4591009893730206870.bin' '-l' '-1' '-v' '-w' '/tmp/graph4591009893730206870.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:59:06] [INFO ] Decomposing Gal with order
[2025-05-31 02:59:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:59:06] [INFO ] Removed a total of 15 redundant transitions.
[2025-05-31 02:59:06] [INFO ] Flatten gal took : 11 ms
[2025-05-31 02:59:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-05-31 02:59:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6703155281559025598.gal : 3 ms
[2025-05-31 02:59:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4466540598546182716.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/CTLFireability6703155281559025598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4466540598546182716.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.
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,6.0935e+15,1.41986,33272,3101,74,42003,594,688,209733,80,1789,0
Converting to forward existential form...Done !
original formula: EF((EX(((i2.i0.u14.p53==0)||(i11.i1.u66.p242==0))) * EX(EG(((i0.i1.u1.p3==0)||(i1.u9.p41==0))))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * EX(((i2.i0.u14.p53==0)||(i11.i1.u66.p242==0))))),((i0.i1.u1.p3==0)||(i1.u9.p41==0)))...165
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t56, t58, t87, t134, t176, i0.i2.u31.t79, i0.i3.u76.t17, i1.u11.t116, i2.i0.u13.t113...747
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 25 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 236 cols
[2025-05-31 02:59:36] [INFO ] Computed 60 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:59:36] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-05-31 02:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:59:37] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 02:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:42] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:42] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:42] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:42] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:42] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:43] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:44] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:45] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:46] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:46] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:46] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:47] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:48] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:52] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:53] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:53] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:57] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:57] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:59] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:59:59] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:05] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 360 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 64/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:10] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:10] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:11] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/366 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/543 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:17] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:17] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:17] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 548 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 03:00:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 03:00:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 03:00:37] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 03:00:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 03:00:37] [INFO ] Flatten gal took : 4 ms
[2025-05-31 03:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16999098094463136521.gal : 2 ms
[2025-05-31 03:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1530027906455153598.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/CTLFireability16999098094463136521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1530027906455153598.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-05-31 03:01:07] [INFO ] Flatten gal took : 4 ms
[2025-05-31 03:01:07] [INFO ] Applying decomposition
[2025-05-31 03:01:07] [INFO ] Flatten gal took : 4 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/graph12016940413379856258.txt' '-o' '/tmp/graph12016940413379856258.bin' '-w' '/tmp/graph12016940413379856258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12016940413379856258.bin' '-l' '-1' '-v' '-w' '/tmp/graph12016940413379856258.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:01:07] [INFO ] Decomposing Gal with order
[2025-05-31 03:01:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:01:07] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 03:01:07] [INFO ] Flatten gal took : 11 ms
[2025-05-31 03:01:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 03:01:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11363468683987064239.gal : 3 ms
[2025-05-31 03:01:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7188011744018190794.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/CTLFireability11363468683987064239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7188011744018190794.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.
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,3.71666e+15,0.52345,16628,2172,71,29997,779,598,43579,80,2443,0
Converting to forward existential form...Done !
original formula: EF(AX(((i8.i1.i0.u43.p164==1)&&(i8.i1.i0.u49.p190==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i8.i1.i0.u43.p164==1)&&(i8.i1.i0.u49.p190==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t131, t172, i0.t119, i0.u8.t124, i0.u8.t125, i0.u9.t121, i0.u9.t122, i1.u12.t11...711
(forward)formula 0,1,1.82091,51444,1,0,97281,835,2530,243774,364,2760,161832
FORMULA DES-PT-01b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 245 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 237 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 237 transition count 186
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 236 transition count 178
Applied a total of 62 rules in 13 ms. Remains 236 /261 variables (removed 25) and now considering 178/215 (removed 37) transitions.
[2025-05-31 03:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:01:09] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-05-31 03:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:01:09] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 03:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:15] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:16] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:17] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:18] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:19] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:19] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:20] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:21] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:22] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:22] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/344 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:25] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:25] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:26] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/351 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:29] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:29] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:30] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:31] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:31] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:38] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/414 variables, and 360 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 64/124 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:43] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:43] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:44] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:44] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/414 variables, 236/366 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 177/543 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:49] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:49] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:50] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:01:58] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 548 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 236/261 places, 178/215 transitions.
[2025-05-31 03:02:09] [INFO ] Flatten gal took : 7 ms
[2025-05-31 03:02:09] [INFO ] Flatten gal took : 7 ms
[2025-05-31 03:02:09] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 03:02:09] [INFO ] Flatten gal took : 7 ms
[2025-05-31 03:02:09] [INFO ] Flatten gal took : 7 ms
[2025-05-31 03:02:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2579871835850101536.gal : 2 ms
[2025-05-31 03:02:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12816279129477064035.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/CTLFireability2579871835850101536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12816279129477064035.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-05-31 03:02:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 03:02:40] [INFO ] Applying decomposition
[2025-05-31 03:02:40] [INFO ] Flatten gal took : 4 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/graph8240610513457961305.txt' '-o' '/tmp/graph8240610513457961305.bin' '-w' '/tmp/graph8240610513457961305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8240610513457961305.bin' '-l' '-1' '-v' '-w' '/tmp/graph8240610513457961305.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:02:40] [INFO ] Decomposing Gal with order
[2025-05-31 03:02:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:02:40] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 03:02:40] [INFO ] Flatten gal took : 10 ms
[2025-05-31 03:02:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-05-31 03:02:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16385936050321922093.gal : 3 ms
[2025-05-31 03:02:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12086195734088482980.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/CTLFireability16385936050321922093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12086195734088482980.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.
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,3.71666e+15,0.510495,18396,2034,72,34825,600,709,51043,86,1768,0
Converting to forward existential form...Done !
original formula: (AX(AG(!(A(E((i8.i1.u40.p156==1) U ((i10.i1.u44.p164==1)&&(i10.i1.u50.p190==1))) U EF(((i10.i1.u44.p164==1)&&(i10.i1.u50.p190==1))))))) +...233
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(E(TRUE U !(!(!((E(!(E(TRUE U ((i10.i1.u44.p164==1)&&(i10.i1.u50.p190==1)))) U (!(E((i8....442
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t62, t87, t131, t172, i0.i1.u31.t79, i0.i2.u75.t17, i1.u33.t76, i2.i1.u13.t112, i2.i...749
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 215/215 transitions.
Graph (complete) has 470 edges and 261 vertex of which 254 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 192
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 192
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 182
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 226 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 214 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 214 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 214 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 213 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 213 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 212 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 92 place count 208 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 96 place count 208 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 100 place count 208 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 100 place count 208 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 206 transition count 153
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 232 place count 142 transition count 89
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 233 place count 142 transition count 88
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 236 place count 142 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 140 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 240 place count 138 transition count 86
Applied a total of 240 rules in 80 ms. Remains 138 /261 variables (removed 123) and now considering 86/215 (removed 129) transitions.
// Phase 1: matrix 86 rows 138 cols
[2025-05-31 03:03:10] [INFO ] Computed 56 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:03:10] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 03:03:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:03:10] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [10, 47, 51, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 78, 80, 82, 84, 86, 110, 133]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 412 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/261 places, 86/215 transitions.
Graph (complete) has 243 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 114 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 105 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 47 place count 87 transition count 64
Applied a total of 47 rules in 9 ms. Remains 87 /118 variables (removed 31) and now considering 64/86 (removed 22) transitions.
// Phase 1: matrix 64 rows 87 cols
[2025-05-31 03:03:10] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:03:10] [INFO ] Implicit Places using invariants in 92 ms returned [50, 54, 55, 58, 61, 62, 65, 72, 75]
[2025-05-31 03:03:10] [INFO ] Actually due to overlaps returned [50, 58, 65, 72, 75]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 102 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 82/261 places, 64/215 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 61
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 0 with 2 rules applied. Total rules applied 6 place count 79 transition count 60
Applied a total of 6 rules in 5 ms. Remains 79 /82 variables (removed 3) and now considering 60/64 (removed 4) transitions.
// Phase 1: matrix 60 rows 79 cols
[2025-05-31 03:03:10] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:03:10] [INFO ] Implicit Places using invariants in 70 ms returned [53, 54, 59, 60]
[2025-05-31 03:03:10] [INFO ] Actually due to overlaps returned [53, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 77/261 places, 60/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 682 ms. Remains : 77/261 places, 60/215 transitions.
[2025-05-31 03:03:10] [INFO ] Flatten gal took : 2 ms
[2025-05-31 03:03:10] [INFO ] Flatten gal took : 2 ms
[2025-05-31 03:03:10] [INFO ] Input system was already deterministic with 60 transitions.
[2025-05-31 03:03:10] [INFO ] Flatten gal took : 2 ms
[2025-05-31 03:03:10] [INFO ] Flatten gal took : 1 ms
[2025-05-31 03:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12000948597759749459.gal : 0 ms
[2025-05-31 03:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17746934944959623590.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/CTLFireability12000948597759749459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17746934944959623590.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.
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,1.93486e+07,0.10539,7156,2,4768,5,15102,6,0,365,13351,0
Converting to forward existential form...Done !
original formula: EF(((AF(((p81==1)&&(p102==1))) * ((p21!=1)||((p45==1)&&(p126==1)))) + (((p217==1)&&(p192==0))&&(p113==0))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p21!=1)||((p45==1)&&(p126==1)))) * !(EG(!(((p81==1)&&(p102==1))))))] != FALSE + [(FwdU(I...214
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t9, t13, t15, t41, t42, t44, t45, t46, t51, t56, t57, t58, t59, Intersection wit...236
Detected timeout of ITS tools.
[2025-05-31 03:03:40] [INFO ] Flatten gal took : 3 ms
[2025-05-31 03:03:40] [INFO ] Applying decomposition
[2025-05-31 03:03:40] [INFO ] Flatten gal took : 2 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/graph5656169457457438200.txt' '-o' '/tmp/graph5656169457457438200.bin' '-w' '/tmp/graph5656169457457438200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5656169457457438200.bin' '-l' '-1' '-v' '-w' '/tmp/graph5656169457457438200.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:03:40] [INFO ] Decomposing Gal with order
[2025-05-31 03:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:03:40] [INFO ] Removed a total of 13 redundant transitions.
[2025-05-31 03:03:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 03:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-05-31 03:03:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7457482870598210543.gal : 2 ms
[2025-05-31 03:03:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12390256878550828565.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/CTLFireability7457482870598210543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12390256878550828565.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.
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,1.93486e+07,0.054758,4832,394,86,1938,341,246,2302,79,690,0
Converting to forward existential form...Done !
original formula: EF(((AF(((i3.u9.p81==1)&&(i4.u11.p102==1))) * ((u0.p21!=1)||((i0.i0.u4.p45==1)&&(i0.i1.u2.p126==1)))) + (((i6.u20.p217==1)&&(i6.u19.p192=...183
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((u0.p21!=1)||((i0.i0.u4.p45==1)&&(i0.i1.u2.p126==1)))) * !(EG(!(((i3.u9.p81==1)&&(i4.u11....272
Reverse transition relation is NOT exact ! Due to transitions t41, t56, t59, u0.t15, u1.t13, i0.i0.u3.t9, i0.i1.u14.t2, i1.u17.t45, i3.t44, i3.u10.t51, i4....300
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.22707,96480,1,0,187307,1287,1168,223303,367,4387,176829
FORMULA DES-PT-01b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 03:03:44] [INFO ] Flatten gal took : 8 ms
[2025-05-31 03:03:44] [INFO ] Flatten gal took : 8 ms
[2025-05-31 03:03:44] [INFO ] Applying decomposition
[2025-05-31 03:03:44] [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/graph15650069896928705249.txt' '-o' '/tmp/graph15650069896928705249.bin' '-w' '/tmp/graph15650069896928705249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15650069896928705249.bin' '-l' '-1' '-v' '-w' '/tmp/graph15650069896928705249.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:03:44] [INFO ] Decomposing Gal with order
[2025-05-31 03:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:03:44] [INFO ] Removed a total of 34 redundant transitions.
[2025-05-31 03:03:44] [INFO ] Flatten gal took : 22 ms
[2025-05-31 03:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 6 ms.
[2025-05-31 03:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8734012197637350795.gal : 5 ms
[2025-05-31 03:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7073118737947936041.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/CTLFireability8734012197637350795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7073118737947936041.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 13 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,6.11137e+16,1.37154,40280,4380,69,102016,648,739,75185,89,1987,0
Converting to forward existential form...Done !
original formula: (A((!(AX(!(AF((i1.i0.u6.p17==1))))) * ((!(((i5.u30.p94!=1) * AF((i4.i0.u9.p26==1)))) + (((i11.i0.u54.p181==1)||(i6.u35.p121==1)) * AF(((i...763
=> equivalent forward existential formula: (([FwdG((FwdU((Init * !(!((E(!(EG((!(((i6.u34.p113==1)||((i9.i1.u49.p161==1)&&(i4.i1.u7.p18==1)))) * !((E(TRUE U...3959
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t52, t56, t93, t155, t182, i0.u40.t76, i1.i2.u83.t17, i2.t205, i2.i0.u38.t79, i2.i1.u...844
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-31 03:33:13] [INFO ] Applying decomposition
[2025-05-31 03:33:13] [INFO ] Flatten gal took : 7 ms
[2025-05-31 03:33:13] [INFO ] Decomposing Gal with order
[2025-05-31 03:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:33:13] [INFO ] Removed a total of 20 redundant transitions.
[2025-05-31 03:33:13] [INFO ] Flatten gal took : 13 ms
[2025-05-31 03:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 7 ms.
[2025-05-31 03:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9253206438400803559.gal : 3 ms
[2025-05-31 03:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7633096280591740189.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9253206438400803559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7633096280591740189.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 13 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,6.11137e+16,20.4125,549168,57767,189,619689,885,638,5.3107e+06,141,2360,0
Converting to forward existential form...Done !
original formula: (A((!(AX(!(AF((i1.i0.i0.i0.i0.u121.p17==1))))) * ((!(((i1.i0.i1.i0.i1.i0.i1.u133.p94!=1) * AF((i1.i0.i0.i0.i0.i0.i0.u15.p26==1)))) + (((i...1250
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="DES-PT-01b"
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 DES-PT-01b, 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-174854063800242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b 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 ;