About the Execution of ITS-Tools for DES-PT-00b
| 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???????F????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063800226.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-00b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063800226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 66K 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-00b-CTLFireability-2023-12
FORMULA_NAME DES-PT-00b-CTLFireability-2023-13
FORMULA_NAME DES-PT-00b-CTLFireability-2023-14
FORMULA_NAME DES-PT-00b-CTLFireability-2023-15
FORMULA_NAME DES-PT-00b-CTLFireability-2025-00
FORMULA_NAME DES-PT-00b-CTLFireability-2025-01
FORMULA_NAME DES-PT-00b-CTLFireability-2025-02
FORMULA_NAME DES-PT-00b-CTLFireability-2025-03
FORMULA_NAME DES-PT-00b-CTLFireability-2025-04
FORMULA_NAME DES-PT-00b-CTLFireability-2025-05
FORMULA_NAME DES-PT-00b-CTLFireability-2025-06
FORMULA_NAME DES-PT-00b-CTLFireability-2025-07
FORMULA_NAME DES-PT-00b-CTLFireability-2025-08
FORMULA_NAME DES-PT-00b-CTLFireability-2025-09
FORMULA_NAME DES-PT-00b-CTLFireability-2025-10
FORMULA_NAME DES-PT-00b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748652416822
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-00b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 00:46:59] [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 00:46:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:46:59] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2025-05-31 00:46:59] [INFO ] Transformed 271 places.
[2025-05-31 00:46:59] [INFO ] Transformed 230 transitions.
[2025-05-31 00:46:59] [INFO ] Found NUPN structural information;
[2025-05-31 00:46:59] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 139 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 259 transition count 220
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 259 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 256 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 256 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 30 place count 256 transition count 215
Applied a total of 30 rules in 147 ms. Remains 256 /271 variables (removed 15) and now considering 215/230 (removed 15) transitions.
// Phase 1: matrix 215 rows 256 cols
[2025-05-31 00:47:00] [INFO ] Computed 57 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:00] [INFO ] Implicit Places using invariants in 610 ms returned []
[2025-05-31 00:47:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:47:01] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-05-31 00:47:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:08] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:08] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 12 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 00:47:09] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:09] [INFO ] Deduced a trap composed of 22 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 00:47:09] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 16 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 00:47:10] [INFO ] Deduced a trap composed of 17 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 00:47:10] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 19 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 00:47:10] [INFO ] Deduced a trap composed of 19 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 00:47:10] [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 00:47:10] [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 00:47:10] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:11] [INFO ] Deduced a trap composed of 26 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 00:47:12] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:12] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:13] [INFO ] Deduced a trap composed of 10 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 00:47:13] [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 00:47:13] [INFO ] Deduced a trap composed of 11 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 00:47:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:14] [INFO ] Deduced a trap composed of 28 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 00:47:15] [INFO ] Deduced a trap composed of 13 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 00:47:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 215/471 variables, 256/348 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:22] [INFO ] Deduced a trap composed of 12 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 00:47:22] [INFO ] Deduced a trap composed of 14 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 00:47:22] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:27] [INFO ] Deduced a trap composed of 19 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 00:47:27] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:29] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:29] [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 00:47:29] [INFO ] Deduced a trap composed of 20 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 00:47:29] [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 00:47:30] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:30] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:30] [INFO ] Deduced a trap composed of 23 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 00:47:30] [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 00:47:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 362 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30272 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 49/106 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/471 variables, 256/362 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 214/576 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:40] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:42] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:42] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:51] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:53] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:47:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:01] [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 00:48:01] [INFO ] Deduced a trap composed of 31 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 00:48:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 592 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Starting structural reductions in LTL mode, iteration 1 : 256/271 places, 215/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61893 ms. Remains : 256/271 places, 215/230 transitions.
Support contains 139 out of 256 places after structural reductions.
[2025-05-31 00:48:02] [INFO ] Flatten gal took : 94 ms
[2025-05-31 00:48:02] [INFO ] Flatten gal took : 46 ms
[2025-05-31 00:48:02] [INFO ] Input system was already deterministic with 215 transitions.
RANDOM walk for 40000 steps (370 resets) in 2344 ms. (17 steps per ms) remains 8/91 properties
BEST_FIRST walk for 40004 steps (49 resets) in 299 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (59 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 111 ms. (357 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (48 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (49 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (59 resets) in 118 ms. (336 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
[2025-05-31 00:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 128/162 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 39/201 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 34/235 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 199/434 variables, 235/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 22/456 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/458 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 13 (OVERLAPS) 8/466 variables, 6/310 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:04] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 3/469 variables, 2/313 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/469 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/471 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/471 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/471 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 314 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 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/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp86 is UNSAT
At refinement iteration 1 (OVERLAPS) 126/157 variables, 24/24 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 42/199 variables, 10/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 34/233 variables, 22/56 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/57 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 197/430 variables, 233/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 2/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/452 variables, 12/304 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 2/306 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 00:48:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:06] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 2/308 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 00:48:06] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 1/309 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/309 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/454 variables, 1/310 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/454 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/464 variables, 7/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/464 variables, 0/317 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 5/469 variables, 3/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/469 variables, 0/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/471 variables, 1/321 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/471 variables, 0/321 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/471 variables, 0/321 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 321 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4615ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3148 ms.
Support contains 29 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 215/215 transitions.
Graph (complete) has 463 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 21 rules applied. Total rules applied 22 place count 252 transition count 190
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 233 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 231 transition count 188
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 45 place count 231 transition count 180
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 61 place count 223 transition count 180
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 73 place count 211 transition count 168
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 211 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 211 transition count 165
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 94 place count 205 transition count 159
Iterating global reduction 4 with 6 rules applied. Total rules applied 100 place count 205 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 105 place count 205 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 205 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 204 transition count 153
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 225 place count 145 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 144 transition count 94
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 228 place count 144 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 144 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 143 transition count 92
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 143 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 234 place count 141 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 141 transition count 89
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 237 place count 141 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 140 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 239 place count 139 transition count 88
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 8 with 2 rules applied. Total rules applied 241 place count 138 transition count 87
Applied a total of 241 rules in 117 ms. Remains 138 /256 variables (removed 118) and now considering 87/215 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 138/256 places, 87/215 transitions.
RANDOM walk for 40000 steps (1014 resets) in 1025 ms. (38 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (210 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (238 resets) in 246 ms. (161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (230 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
// Phase 1: matrix 87 rows 138 cols
[2025-05-31 00:48:12] [INFO ] Computed 58 invariants in 10 ms
[2025-05-31 00:48:12] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/63 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 46/109 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/133 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 87/221 variables, 134/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 4/225 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/225 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 138/138 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/38 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/63 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 46/109 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/133 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 87/221 variables, 134/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:12] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Int declared 225/225 variables, and 199 constraints, problems are : Problem set: 1 solved, 0 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 35/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 138/138 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 628ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-00b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 00:48:12] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:48:12] [INFO ] Flatten gal took : 30 ms
[2025-05-31 00:48:13] [INFO ] Input system was already deterministic with 215 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 463 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 239 transition count 195
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 230 transition count 186
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 230 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 61 place count 230 transition count 180
Applied a total of 61 rules in 39 ms. Remains 230 /256 variables (removed 26) and now considering 180/215 (removed 35) transitions.
// Phase 1: matrix 180 rows 230 cols
[2025-05-31 00:48:13] [INFO ] Computed 57 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:13] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-05-31 00:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:48:13] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-31 00:48:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 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 00:48:19] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 15 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 00:48:20] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 21 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 00:48:20] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 21 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 00:48:21] [INFO ] Deduced a trap composed of 21 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 00:48:21] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:21] [INFO ] Deduced a trap composed of 17 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 00:48:21] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:21] [INFO ] Deduced a trap composed of 17 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 00:48:21] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:21] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:22] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:22] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:22] [INFO ] Deduced a trap composed of 18 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 00:48:22] [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 00:48:22] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 20/77 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 00:48:22] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:23] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:23] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:23] [INFO ] Deduced a trap composed of 12 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 00:48:24] [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 00:48:24] [INFO ] Deduced a trap composed of 9 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 00:48:24] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 7/84 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 00:48:25] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:25] [INFO ] Deduced a trap composed of 24 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 00:48:25] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 3/87 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 00:48:28] [INFO ] Deduced a trap composed of 28 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 00:48:29] [INFO ] Deduced a trap composed of 28 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 00:48:29] [INFO ] Deduced a trap composed of 16 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 00:48:29] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 4/91 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 00:48:30] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/92 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 00:48:32] [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 00:48:32] [INFO ] Deduced a trap composed of 19 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 00:48:32] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 180/410 variables, 230/325 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 00:48:38] [INFO ] Deduced a trap composed of 17 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 00:48:38] [INFO ] Deduced a trap composed of 18 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 00:48:39] [INFO ] Deduced a trap composed of 20 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 00:48:39] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:39] [INFO ] Deduced a trap composed of 21 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 00:48:39] [INFO ] Deduced a trap composed of 22 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 00:48:39] [INFO ] Deduced a trap composed of 22 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 00:48:39] [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 00:48:39] [INFO ] Deduced a trap composed of 15 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 00:48:40] [INFO ] Deduced a trap composed of 11 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 00:48:40] [INFO ] Deduced a trap composed of 15 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 00:48:40] [INFO ] Deduced a trap composed of 13 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 00:48:41] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 13/338 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 338 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 51/51 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/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/410 variables, 230/338 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 179/517 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 00:48:49] [INFO ] Deduced a trap composed of 15 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 00:48:50] [INFO ] Deduced a trap composed of 16 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 00:48:50] [INFO ] Deduced a trap composed of 17 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 00:48:50] [INFO ] Deduced a trap composed of 18 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 00:48:50] [INFO ] Deduced a trap composed of 19 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 00:48:50] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:50] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:51] [INFO ] Deduced a trap composed of 23 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 00:48:51] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 9/526 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 00:48:55] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:48:55] [INFO ] Deduced a trap composed of 19 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 00:48:55] [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 00:48:55] [INFO ] Deduced a trap composed of 21 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 00:48:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 5/531 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 00:49:07] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 532 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 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 60061ms
Starting structural reductions in LTL mode, iteration 1 : 230/256 places, 180/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60894 ms. Remains : 230/256 places, 180/215 transitions.
[2025-05-31 00:49:13] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:49:13] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:49:13] [INFO ] Input system was already deterministic with 180 transitions.
[2025-05-31 00:49:14] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:49:14] [INFO ] Flatten gal took : 12 ms
[2025-05-31 00:49:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13893003667783432972.gal : 6 ms
[2025-05-31 00:49:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15856153228716822496.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/CTLFireability13893003667783432972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15856153228716822496.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 00:49:44] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:49:44] [INFO ] Applying decomposition
[2025-05-31 00:49:44] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph555886861868642608.txt' '-o' '/tmp/graph555886861868642608.bin' '-w' '/tmp/graph555886861868642608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph555886861868642608.bin' '-l' '-1' '-v' '-w' '/tmp/graph555886861868642608.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:49:44] [INFO ] Decomposing Gal with order
[2025-05-31 00:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:49:44] [INFO ] Removed a total of 15 redundant transitions.
[2025-05-31 00:49:44] [INFO ] Flatten gal took : 74 ms
[2025-05-31 00:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2025-05-31 00:49:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5188551668687470003.gal : 13 ms
[2025-05-31 00:49:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3924037572523823214.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/CTLFireability5188551668687470003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3924037572523823214.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.15533e+17,1.26868,35404,2175,81,70654,910,584,97219,86,3123,0
Converting to forward existential form...Done !
original formula: AF(((EF(AX((i1.u6.p20==0))) * (i8.u57.p196==1)) * (((i4.u25.p88==1)||(i2.u9.p25==0))||((i3.u30.p113==0)||((i1.u5.p16==0)&&((i4.u19.p74==0...180
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(EX(!((i1.u6.p20==0))))) * (i8.u57.p196==1)) * (((i4.u25.p88==1)||(i2.u9.p25==0))||((i3...237
Reverse transition relation is NOT exact ! Due to transitions t52, t85, t120, t141, t142, t174, i0.u4.t127, i0.u4.t128, i0.u11.t110, i1.t125, i1.u5.t123, i...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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Graph (complete) has 463 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 251 transition count 191
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 232 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 231 transition count 190
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 41 place count 231 transition count 183
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 55 place count 224 transition count 183
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 210 transition count 169
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 210 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 210 transition count 166
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 95 place count 201 transition count 157
Iterating global reduction 4 with 9 rules applied. Total rules applied 104 place count 201 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 113 place count 201 transition count 148
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 200 transition count 147
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 200 transition count 144
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 197 transition count 144
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 253 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 129 transition count 76
Reduce places removed 1 places and 0 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 6 with 2 rules applied. Total rules applied 257 place count 128 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 258 place count 127 transition count 75
Applied a total of 258 rules in 101 ms. Remains 127 /256 variables (removed 129) and now considering 75/215 (removed 140) transitions.
// Phase 1: matrix 75 rows 127 cols
[2025-05-31 00:50:14] [INFO ] Computed 56 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 00:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 00:50:15] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 00:50:15] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2025-05-31 00:50:15] [INFO ] Invariant cache hit.
[2025-05-31 00:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:16] [INFO ] Deduced a trap composed of 3 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 00:50:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 75/202 variables, 127/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 188 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5118 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/202 variables, 127/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 74/262 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:22] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:50:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/202 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 15131 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 127/127 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20262ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 20263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/256 places, 75/215 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21165 ms. Remains : 127/256 places, 75/215 transitions.
[2025-05-31 00:50:35] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:50:35] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:50:35] [INFO ] Input system was already deterministic with 75 transitions.
[2025-05-31 00:50:35] [INFO ] Flatten gal took : 5 ms
[2025-05-31 00:50:35] [INFO ] Flatten gal took : 6 ms
[2025-05-31 00:50:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10872047239448807543.gal : 3 ms
[2025-05-31 00:50:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1298486551376538989.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/CTLFireability10872047239448807543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1298486551376538989.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 00:51:05] [INFO ] Flatten gal took : 6 ms
[2025-05-31 00:51:05] [INFO ] Applying decomposition
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11126293744651054720.txt' '-o' '/tmp/graph11126293744651054720.bin' '-w' '/tmp/graph11126293744651054720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11126293744651054720.bin' '-l' '-1' '-v' '-w' '/tmp/graph11126293744651054720.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:51:05] [INFO ] Decomposing Gal with order
[2025-05-31 00:51:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:51:05] [INFO ] Removed a total of 7 redundant transitions.
[2025-05-31 00:51:05] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:51:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 00:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13265206592195236762.gal : 4 ms
[2025-05-31 00:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6149620317110145454.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/CTLFireability13265206592195236762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6149620317110145454.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,9.26843e+10,0.308989,13148,629,60,21687,234,320,27031,71,523,0
Converting to forward existential form...Done !
original formula: !(A(E((i12.u46.p240!=1) U AF(((i12.u16.p134==1)&&(i12.u16.p136==1)))) U (i13.u5.p54==1)))
=> equivalent forward existential formula: ([((FwdU(Init,!((i13.u5.p54==1))) * !((i13.u5.p54==1))) * !(E((i12.u46.p240!=1) U !(EG(!(((i12.u16.p134==1)&&(i1...230
Reverse transition relation is NOT exact ! Due to transitions t64, t67, t68, t72, i0.u0.t17, i0.u7.t8, i0.u8.t10, i1.u9.t6, i1.u10.t50, i2.u2.t12, i3.t69, ...312
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 241 transition count 200
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 241 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 241 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 233 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 233 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 233 transition count 183
Applied a total of 55 rules in 15 ms. Remains 233 /256 variables (removed 23) and now considering 183/215 (removed 32) transitions.
// Phase 1: matrix 183 rows 233 cols
[2025-05-31 00:51:36] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:36] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-31 00:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:51:36] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-05-31 00:51:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 11/57 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 00:51:41] [INFO ] Deduced a trap composed of 11 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 00:51:41] [INFO ] Deduced a trap composed of 12 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 00:51:41] [INFO ] Deduced a trap composed of 15 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 00:51:42] [INFO ] Deduced a trap composed of 20 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 00:51:42] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:42] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:42] [INFO ] Deduced a trap composed of 22 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 00:51:42] [INFO ] Deduced a trap composed of 13 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 00:51:42] [INFO ] Deduced a trap composed of 16 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 00:51:42] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:42] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:43] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:43] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:43] [INFO ] Deduced a trap composed of 13 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 00:51:43] [INFO ] Deduced a trap composed of 28 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 00:51:43] [INFO ] Deduced a trap composed of 31 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 00:51:43] [INFO ] Deduced a trap composed of 13 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 00:51:43] [INFO ] Deduced a trap composed of 14 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 00:51:43] [INFO ] Deduced a trap composed of 9 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 00:51:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 20/77 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 00:51:44] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:44] [INFO ] Deduced a trap composed of 28 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 00:51:45] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 5/82 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 00:51:46] [INFO ] Deduced a trap composed of 24 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 00:51:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:46] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 4/86 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 00:51:48] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/87 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 00:51:49] [INFO ] Deduced a trap composed of 17 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 00:51:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 18 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 00:51:50] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 17 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 00:51:50] [INFO ] Deduced a trap composed of 19 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 00:51:50] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:50] [INFO ] Deduced a trap composed of 18 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 00:51:50] [INFO ] Deduced a trap composed of 18 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 00:51:50] [INFO ] Deduced a trap composed of 20 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 00:51:50] [INFO ] Deduced a trap composed of 20 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 00:51:50] [INFO ] Deduced a trap composed of 21 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 00:51:51] [INFO ] Deduced a trap composed of 19 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 00:51:51] [INFO ] Deduced a trap composed of 21 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 00:51:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:51] [INFO ] Deduced a trap composed of 20 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 00:51:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:51:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 20/107 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 00:51:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 183/416 variables, 233/341 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 00:51:57] [INFO ] Deduced a trap composed of 15 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 00:51:58] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/343 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 00:52:01] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:02] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 2/345 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 00:52:05] [INFO ] Deduced a trap along path composed of 8 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:05] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/416 variables, and 347 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 4/4 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/232 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 53/110 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 00:52:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/416 variables, 233/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 182/526 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 00:52:12] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:13] [INFO ] Deduced a trap composed of 13 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 00:52:13] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/529 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 00:52:17] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:19] [INFO ] Deduced a trap composed of 14 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 00:52:20] [INFO ] Deduced a trap composed of 15 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 00:52:20] [INFO ] Deduced a trap composed of 16 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 00:52:20] [INFO ] Deduced a trap composed of 17 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 00:52:20] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 6/535 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 00:52:29] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:30] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:52:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 182 unsolved
SMT process timed out in 60064ms, After SMT, problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 233/256 places, 183/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 233/256 places, 183/215 transitions.
[2025-05-31 00:52:36] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:52:36] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:52:36] [INFO ] Input system was already deterministic with 183 transitions.
[2025-05-31 00:52:36] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:52:36] [INFO ] Flatten gal took : 7 ms
[2025-05-31 00:52:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8523834486171109620.gal : 2 ms
[2025-05-31 00:52:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13619778420782956374.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/CTLFireability8523834486171109620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13619778420782956374.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 00:53:06] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:53:06] [INFO ] Applying decomposition
[2025-05-31 00:53:06] [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/graph12901848392892428597.txt' '-o' '/tmp/graph12901848392892428597.bin' '-w' '/tmp/graph12901848392892428597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12901848392892428597.bin' '-l' '-1' '-v' '-w' '/tmp/graph12901848392892428597.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:53:06] [INFO ] Decomposing Gal with order
[2025-05-31 00:53:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:53:06] [INFO ] Removed a total of 15 redundant transitions.
[2025-05-31 00:53:07] [INFO ] Flatten gal took : 26 ms
[2025-05-31 00:53:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 15 ms.
[2025-05-31 00:53:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12749868625563878846.gal : 5 ms
[2025-05-31 00:53:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14060108861425971341.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/CTLFireability12749868625563878846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14060108861425971341.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,6.97704e+17,2.52265,43036,2116,80,64036,591,706,162055,93,1841,0
Converting to forward existential form...Done !
original formula: EX((AF(((i2.i1.u5.p24==1)&&(i3.u24.p83==1))) * (EG(EX((i10.i0.u11.p51==0))) + !(E(E((i0.i1.u33.p120==1) U (i5.u28.p108==1)) U ((EG(((i10....428
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(EG(!(((i2.i1.u5.p24==1)&&(i3.u24.p83==1)))))),EX((i10.i0.u11.p51==0)))] != FALSE + [((EY(In...552
Reverse transition relation is NOT exact ! Due to transitions t8, t50, t54, t85, t143, t144, t156, i0.i1.t74, i1.i1.t124, i1.i1.u3.t129, i1.i1.u3.t130, i1....766
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 198
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 239 transition count 196
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 228 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 228 transition count 185
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 228 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 227 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 227 transition count 175
Applied a total of 69 rules in 19 ms. Remains 227 /256 variables (removed 29) and now considering 175/215 (removed 40) transitions.
// Phase 1: matrix 175 rows 227 cols
[2025-05-31 00:53:37] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:37] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-05-31 00:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:53:37] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-05-31 00:53: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/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:42] [INFO ] Deduced a trap composed of 11 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 00:53:42] [INFO ] Deduced a trap composed of 12 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 00:53:42] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53: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 00:53:42] [INFO ] Deduced a trap composed of 22 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 00:53:42] [INFO ] Deduced a trap composed of 21 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 00:53:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 16 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 00:53:43] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 17 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 00:53:43] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:43] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 28 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 00:53:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [INFO ] Deduced a trap composed of 19 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 00:53:45] [INFO ] Deduced a trap composed of 19 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 00:53:45] [INFO ] Deduced a trap composed of 20 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 00:53:45] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [INFO ] Deduced a trap composed of 20 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 00:53:45] [INFO ] Deduced a trap composed of 21 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 00:53:45] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [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 00:53:45] [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 00:53:45] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:45] [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 00:53:46] [INFO ] Deduced a trap composed of 22 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 00:53:46] [INFO ] Deduced a trap composed of 23 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 00:53:46] [INFO ] Deduced a trap composed of 9 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 00:53:46] [INFO ] Deduced a trap composed of 10 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 00:53:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:46] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:47] [INFO ] Deduced a trap composed of 12 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 00:53:47] [INFO ] Deduced a trap composed of 13 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 00:53:47] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:48] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 175/402 variables, 227/331 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:54] [INFO ] Deduced a trap composed of 31 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 00:53:55] [INFO ] Deduced a trap composed of 12 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 00:53:55] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:53:59] [INFO ] Deduced a trap along path composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:06] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/402 variables, and 337 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:08] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/402 variables, 227/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 174/510 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:12] [INFO ] Deduced a trap composed of 13 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 00:54:12] [INFO ] Deduced a trap composed of 14 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 00:54:12] [INFO ] Deduced a trap composed of 15 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 00:54:13] [INFO ] Deduced a trap composed of 16 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 00:54:13] [INFO ] Deduced a trap composed of 17 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 00:54:13] [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 00:54:13] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 7/517 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:19] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:29] [INFO ] Deduced a trap composed of 18 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 00:54:29] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:31] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:31] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:32] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:32] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:32] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:32] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:54:33] [INFO ] Deduced a trap composed of 25 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 00:54:33] [INFO ] Deduced a trap composed of 27 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 00:54:33] [INFO ] Deduced a trap composed of 28 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 00:54:34] [INFO ] Deduced a trap composed of 29 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 00:54:34] [INFO ] Deduced a trap composed of 30 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 00:54:34] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 14/532 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SMT process timed out in 60044ms, After SMT, problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 227/256 places, 175/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60752 ms. Remains : 227/256 places, 175/215 transitions.
[2025-05-31 00:54:37] [INFO ] Flatten gal took : 7 ms
[2025-05-31 00:54:37] [INFO ] Flatten gal took : 8 ms
[2025-05-31 00:54:37] [INFO ] Input system was already deterministic with 175 transitions.
[2025-05-31 00:54:37] [INFO ] Flatten gal took : 14 ms
[2025-05-31 00:54:37] [INFO ] Flatten gal took : 6 ms
[2025-05-31 00:54:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8568399962480957595.gal : 2 ms
[2025-05-31 00:54:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10093053261437927891.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/CTLFireability8568399962480957595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10093053261437927891.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 00:55:08] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:55:08] [INFO ] Applying decomposition
[2025-05-31 00:55:08] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15295547328817424133.txt' '-o' '/tmp/graph15295547328817424133.bin' '-w' '/tmp/graph15295547328817424133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15295547328817424133.bin' '-l' '-1' '-v' '-w' '/tmp/graph15295547328817424133.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:55:08] [INFO ] Decomposing Gal with order
[2025-05-31 00:55:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:55:08] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 00:55:08] [INFO ] Flatten gal took : 25 ms
[2025-05-31 00:55:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2025-05-31 00:55:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8628939005118784729.gal : 7 ms
[2025-05-31 00:55:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16297053008214499102.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/CTLFireability8628939005118784729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16297053008214499102.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.55618e+17,1.63686,40112,2553,83,72035,511,641,123650,92,1512,0
Converting to forward existential form...Done !
original formula: AF(AG(((EG(E((i0.u2.p6==1) U ((i4.u24.p93==1)&&(i4.u26.p103==1)))) * AF(((i8.i1.u52.p193==1)&&(i8.i1.u52.p220==1)))) * AX(((AF((i2.u1.p1=...227
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EG(E((i0.u2.p6==1) U ((i4.u24.p93==1)&&(i4.u26.p103==1)))) * !(EG(!(((i8.i1.u52.p193...302
Reverse transition relation is NOT exact ! Due to transitions t52, t54, t56, t135, t136, i0.t118, i0.u3.t123, i0.u3.t124, i0.u4.t120, i0.u4.t121, i0.u8.t11...728
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 238 transition count 194
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 227 transition count 183
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 227 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 226 transition count 173
Applied a total of 72 rules in 34 ms. Remains 226 /256 variables (removed 30) and now considering 173/215 (removed 42) transitions.
// Phase 1: matrix 173 rows 226 cols
[2025-05-31 00:55:38] [INFO ] Computed 57 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:38] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-31 00:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:55:38] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-05-31 00:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:44] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:44] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:44] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:44] [INFO ] Deduced a trap composed of 20 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 00:55:45] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:45] [INFO ] Deduced a trap composed of 21 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 00:55:45] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:45] [INFO ] Deduced a trap composed of 16 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 00:55:45] [INFO ] Deduced a trap composed of 17 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 00:55:45] [INFO ] Deduced a trap composed of 14 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 00:55:46] [INFO ] Deduced a trap composed of 9 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 00:55:46] [INFO ] Deduced a trap composed of 10 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 00:55:46] [INFO ] Deduced a trap composed of 13 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 00:55:46] [INFO ] Deduced a trap composed of 12 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 00:55:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:46] [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 00:55:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:47] [INFO ] Deduced a trap composed of 28 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 00:55:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:47] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:48] [INFO ] Deduced a trap composed of 28 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 00:55:48] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:48] [INFO ] Deduced a trap composed of 16 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 00:55:48] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:50] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:50] [INFO ] Deduced a trap composed of 15 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 00:55:50] [INFO ] Deduced a trap composed of 16 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 00:55:50] [INFO ] Deduced a trap composed of 17 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 00:55:50] [INFO ] Deduced a trap composed of 18 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 00:55:50] [INFO ] Deduced a trap composed of 19 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 00:55:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:55:53] [INFO ] Deduced a trap composed of 18 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 00:55:54] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 173/399 variables, 226/316 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:00] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:00] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:00] [INFO ] Deduced a trap composed of 17 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 00:56:01] [INFO ] Deduced a trap composed of 15 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 00:56:01] [INFO ] Deduced a trap composed of 19 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 00:56:01] [INFO ] Deduced a trap composed of 17 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 00:56:01] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:03] [INFO ] Deduced a trap composed of 15 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 00:56:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:07] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 326 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:09] [INFO ] Deduced a trap composed of 19 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 00:56:09] [INFO ] Deduced a trap composed of 20 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 00:56:10] [INFO ] Deduced a trap composed of 21 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 00:56:10] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:11] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:11] [INFO ] Deduced a trap composed of 27 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 00:56:11] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:12] [INFO ] Deduced a trap composed of 29 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 00:56:12] [INFO ] Deduced a trap composed of 30 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 00:56:12] [INFO ] Deduced a trap composed of 31 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 00:56:12] [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 00:56:12] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:14] [INFO ] Deduced a trap composed of 20 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 00:56:14] [INFO ] Deduced a trap composed of 21 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 00:56:14] [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 00:56:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:15] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:16] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:16] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 173/399 variables, 226/344 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 172/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:25] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:25] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:56:35] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 519 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 173/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 226/256 places, 173/215 transitions.
[2025-05-31 00:56:38] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:56:38] [INFO ] Flatten gal took : 10 ms
[2025-05-31 00:56:38] [INFO ] Input system was already deterministic with 173 transitions.
[2025-05-31 00:56:38] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:56:38] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:56:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8066290257870710737.gal : 2 ms
[2025-05-31 00:56:38] [INFO ] Time to serialize properties into /tmp/CTLFireability257462406346950638.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/CTLFireability8066290257870710737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability257462406346950638.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:57:09] [INFO ] Flatten gal took : 7 ms
[2025-05-31 00:57:09] [INFO ] Applying decomposition
[2025-05-31 00:57:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3035754204241154931.txt' '-o' '/tmp/graph3035754204241154931.bin' '-w' '/tmp/graph3035754204241154931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3035754204241154931.bin' '-l' '-1' '-v' '-w' '/tmp/graph3035754204241154931.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:57:09] [INFO ] Decomposing Gal with order
[2025-05-31 00:57:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:57:09] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 00:57:09] [INFO ] Flatten gal took : 16 ms
[2025-05-31 00:57:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 00:57:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12311309444948600329.gal : 4 ms
[2025-05-31 00:57:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9038306774046658342.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/CTLFireability12311309444948600329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9038306774046658342.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.22197e+17,1.13998,29552,2565,90,58837,632,634,71445,94,1882,0
Converting to forward existential form...Done !
original formula: AF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t60, t85, t97, t134, t135, i0.t117, i0.u3.t122, i0.u3.t123, i0.u4.t119, i0.u4.t120, i0.u...707
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 240 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 240 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 240 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 232 transition count 188
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 232 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 232 transition count 181
Applied a total of 58 rules in 12 ms. Remains 232 /256 variables (removed 24) and now considering 181/215 (removed 34) transitions.
// Phase 1: matrix 181 rows 232 cols
[2025-05-31 00:57:39] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:39] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-31 00:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:57:39] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-05-31 00:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:45] [INFO ] Deduced a trap composed of 22 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 00:57:45] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:45] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:45] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:46] [INFO ] Deduced a trap composed of 20 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 00:57:46] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:46] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:46] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:46] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:46] [INFO ] Deduced a trap composed of 16 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 00:57:46] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:47] [INFO ] Deduced a trap composed of 16 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 00:57:47] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:47] [INFO ] Deduced a trap composed of 14 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 00:57:47] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:47] [INFO ] Deduced a trap composed of 10 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 00:57:47] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:48] [INFO ] Deduced a trap composed of 13 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 00:57:48] [INFO ] Deduced a trap composed of 12 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 00:57:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:48] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:48] [INFO ] Deduced a trap composed of 17 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 00:57:49] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:49] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:49] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:49] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:50] [INFO ] Deduced a trap composed of 12 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 00:57:50] [INFO ] Deduced a trap composed of 9 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 00:57:50] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:51] [INFO ] Deduced a trap composed of 18 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 00:57:51] [INFO ] Deduced a trap composed of 8 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 00:57:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/413 variables, 232/321 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:57] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:57:58] [INFO ] Deduced a trap composed of 15 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 00:57:58] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:02] [INFO ] Deduced a trap composed of 15 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 00:58:02] [INFO ] Deduced a trap composed of 12 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 00:58:02] [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 00:58:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:04] [INFO ] Deduced a trap composed of 17 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 00:58:04] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:04] [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 00:58:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:05] [INFO ] Deduced a trap composed of 19 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 00:58:05] [INFO ] Deduced a trap composed of 20 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 00:58:05] [INFO ] Deduced a trap composed of 20 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 00:58:05] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:05] [INFO ] Deduced a trap composed of 21 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 00:58:05] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:05] [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 00:58:05] [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 00:58:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 13/341 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:08] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.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 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/413 variables, and 342 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 53/110 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 181/413 variables, 232/342 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 180/522 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:15] [INFO ] Deduced a trap composed of 15 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 00:58:15] [INFO ] Deduced a trap composed of 16 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 00:58:15] [INFO ] Deduced a trap composed of 17 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 00:58:15] [INFO ] Deduced a trap composed of 18 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 00:58:15] [INFO ] Deduced a trap composed of 19 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 00:58:17] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:17] [INFO ] Deduced a trap composed of 13 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 00:58:17] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 9/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:26] [INFO ] Deduced a trap along path composed of 3 places in 121 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:27] [INFO ] Deduced a trap along path composed of 8 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 00:58:28] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:58:31] [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 00:58:32] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 5/536 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 536 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 232/256 places, 181/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60730 ms. Remains : 232/256 places, 181/215 transitions.
[2025-05-31 00:58:39] [INFO ] Flatten gal took : 13 ms
[2025-05-31 00:58:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 00:58:39] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-31 00:58:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 00:58:39] [INFO ] Flatten gal took : 5 ms
[2025-05-31 00:58:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8800945241328544552.gal : 2 ms
[2025-05-31 00:58:39] [INFO ] Time to serialize properties into /tmp/CTLFireability622295963802106828.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/CTLFireability8800945241328544552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability622295963802106828.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 00:59:10] [INFO ] Flatten gal took : 11 ms
[2025-05-31 00:59:10] [INFO ] Applying decomposition
[2025-05-31 00:59:10] [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/graph4129754087079459261.txt' '-o' '/tmp/graph4129754087079459261.bin' '-w' '/tmp/graph4129754087079459261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4129754087079459261.bin' '-l' '-1' '-v' '-w' '/tmp/graph4129754087079459261.weights' '-q' '0' '-e' '0.001'
[2025-05-31 00:59:10] [INFO ] Decomposing Gal with order
[2025-05-31 00:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 00:59:10] [INFO ] Removed a total of 13 redundant transitions.
[2025-05-31 00:59:10] [INFO ] Flatten gal took : 15 ms
[2025-05-31 00:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 00:59:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16288444175816112597.gal : 3 ms
[2025-05-31 00:59:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10481785128125483476.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/CTLFireability16288444175816112597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10481785128125483476.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,6.70402e+17,2.33918,53044,2255,83,109652,577,633,176501,91,1591,0
Converting to forward existential form...Done !
original formula: (EF(EG(AG(EX(((i13.i1.u65.p248==0)||(i13.i1.u71.p253==0)))))) * AF(E(((((EF((i2.u12.p53==1)) * E((i13.i0.u70.p257==1) U (i1.i0.u5.p33==1)...373
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG(!(E(TRUE U !(EX(((i13.i1.u65.p248==0)||(i13.i1.u71.p253==0))))))))))] = FALSE * [FwdG(In...488
Reverse transition relation is NOT exact ! Due to transitions t51, t61, t86, t98, t141, t142, i0.t123, i0.u3.t128, i0.u3.t129, i0.u4.t125, i0.u4.t126, i0.u...786
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 238 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 230 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 230 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 61 place count 230 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 229 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 229 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 64 place count 229 transition count 178
Applied a total of 64 rules in 24 ms. Remains 229 /256 variables (removed 27) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 229 cols
[2025-05-31 00:59:40] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:59:40] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-31 00:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 00:59:40] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 00:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 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 00:59:46] [INFO ] Deduced a trap composed of 21 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 00:59:46] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 15 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 00:59:47] [INFO ] Deduced a trap composed of 20 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 00:59:47] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:47] [INFO ] Deduced a trap composed of 16 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 00:59:48] [INFO ] Deduced a trap composed of 17 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 00:59:48] [INFO ] Deduced a trap composed of 14 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 00:59:48] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:48] [INFO ] Deduced a trap composed of 10 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 00:59:48] [INFO ] Deduced a trap composed of 13 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 00:59:48] [INFO ] Deduced a trap composed of 12 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 00:59:48] [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 00:59:49] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:49] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/77 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 00:59:49] [INFO ] Deduced a trap composed of 26 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 00:59:49] [INFO ] Deduced a trap composed of 27 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 00:59:49] [INFO ] Deduced a trap composed of 28 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 00:59:49] [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 00:59:49] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:49] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:50] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:50] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:50] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:50] [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 00:59:50] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:50] [INFO ] Deduced a trap composed of 21 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 00:59:50] [INFO ] Deduced a trap composed of 21 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 00:59:50] [INFO ] Deduced a trap composed of 31 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 00:59:50] [INFO ] Deduced a trap composed of 18 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 00:59:50] [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 00:59:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 17/94 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 00:59:52] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:52] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:52] [INFO ] Deduced a trap composed of 20 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 00:59:52] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:52] [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 00:59:52] [INFO ] Deduced a trap composed of 22 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 00:59:52] [INFO ] Deduced a trap composed of 22 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 00:59:52] [INFO ] Deduced a trap composed of 23 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 00:59:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/407 variables, 229/332 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 00:59:57] [INFO ] Deduced a trap composed of 16 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 00:59:57] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 00:59:57] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 3/335 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 01:00:01] [INFO ] Deduced a trap along path composed of 5 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:01] [INFO ] Deduced a trap along path composed of 4 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:02] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/338 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 01:00:04] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 339 constraints, problems are : Problem set: 0 solved, 177 unsolved in 29243 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 4/4 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/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 49/106 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/407 variables, 229/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 177/512 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 01:00:12] [INFO ] Deduced a trap composed of 13 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 01:00:12] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:13] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:13] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:00:13] [INFO ] Deduced a trap composed of 20 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 01:00:14] [INFO ] Deduced a trap composed of 20 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 01:00:14] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 7/519 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 01:00:19] [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 01:00:19] [INFO ] Deduced a trap composed of 25 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 01:00:21] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 526 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 59279ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 59281ms
Starting structural reductions in LTL mode, iteration 1 : 229/256 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60032 ms. Remains : 229/256 places, 178/215 transitions.
[2025-05-31 01:00:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:00:40] [INFO ] Flatten gal took : 28 ms
[2025-05-31 01:00:40] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 01:00:40] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:00:40] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:00:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7956877221747809445.gal : 1 ms
[2025-05-31 01:00:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6259006610183641786.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/CTLFireability7956877221747809445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6259006610183641786.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 01:01:10] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:01:10] [INFO ] Applying decomposition
[2025-05-31 01:01:10] [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/graph7525558278055531119.txt' '-o' '/tmp/graph7525558278055531119.bin' '-w' '/tmp/graph7525558278055531119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7525558278055531119.bin' '-l' '-1' '-v' '-w' '/tmp/graph7525558278055531119.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:01:10] [INFO ] Decomposing Gal with order
[2025-05-31 01:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:01:10] [INFO ] Removed a total of 16 redundant transitions.
[2025-05-31 01:01:10] [INFO ] Flatten gal took : 15 ms
[2025-05-31 01:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-05-31 01:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3901720272010027387.gal : 3 ms
[2025-05-31 01:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2638535631963944000.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/CTLFireability3901720272010027387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2638535631963944000.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,4.49224e+17,2.34296,51476,2777,67,91897,803,657,131316,84,3239,0
Converting to forward existential form...Done !
original formula: EF((((i6.u33.p129==1) * AX(AG((i8.i1.u53.p194==1)))) * E(((i3.u23.p93==1)&&(i3.u26.p99==1)) U E((((i2.i0.u2.p5==1)&&(i4.i1.u22.p88==1))||...287
=> equivalent forward existential formula: [(FwdU(FwdU(FwdU((FwdU(Init,TRUE) * ((i6.u33.p129==1) * !(EX(!(!(E(TRUE U !((i8.i1.u53.p194==1))))))))),((i3.u23...360
Reverse transition relation is NOT exact ! Due to transitions t54, t119, t138, t139, t171, i0.u4.t122, i0.u4.t123, i1.t115, i1.u5.t128, i2.i0.u3.t125, i2.i...751
(forward)formula 0,0,6.29357,112276,1,0,231129,826,3242,466010,408,3239,356661
FORMULA DES-PT-00b-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 240 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 240 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 240 transition count 197
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 230 transition count 187
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 230 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 230 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 229 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 229 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 64 place count 229 transition count 178
Applied a total of 64 rules in 27 ms. Remains 229 /256 variables (removed 27) and now considering 178/215 (removed 37) transitions.
// Phase 1: matrix 178 rows 229 cols
[2025-05-31 01:01:16] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:17] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-05-31 01:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:01:17] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-31 01:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 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 01:01:23] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:23] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:23] [INFO ] Deduced a trap composed of 15 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 01:01:23] [INFO ] Deduced a trap composed of 20 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 01:01:24] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:24] [INFO ] Deduced a trap composed of 21 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 01:01:24] [INFO ] Deduced a trap composed of 22 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 01:01:24] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:24] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:24] [INFO ] Deduced a trap composed of 16 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 01:01:25] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:25] [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 01:01:25] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:25] [INFO ] Deduced a trap composed of 16 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 01:01:25] [INFO ] Deduced a trap composed of 17 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 01:01:25] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:25] [INFO ] Deduced a trap composed of 12 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 01:01:25] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:26] [INFO ] Deduced a trap composed of 12 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 01:01:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/77 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 01:01:26] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:26] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:27] [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 01:01:27] [INFO ] Deduced a trap composed of 10 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 01:01:27] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 5/82 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 01:01:28] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:28] [INFO ] Deduced a trap composed of 25 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 01:01:29] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:29] [INFO ] Deduced a trap composed of 18 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 01:01:29] [INFO ] Deduced a trap composed of 19 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 01:01:29] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 178/407 variables, 229/317 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 01:01:33] [INFO ] Deduced a trap composed of 16 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 01:01:33] [INFO ] Deduced a trap composed of 18 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 01:01:34] [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 01:01:34] [INFO ] Deduced a trap composed of 12 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 01:01:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 5/322 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 01:01:36] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/323 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 01:01:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:38] [INFO ] Deduced a trap composed of 17 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 01:01:38] [INFO ] Deduced a trap composed of 18 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 01:01:39] [INFO ] Deduced a trap composed of 19 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 01:01:39] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:39] [INFO ] Deduced a trap composed of 20 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 01:01:39] [INFO ] Deduced a trap composed of 20 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 01:01:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 10/333 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 01:01:40] [INFO ] Deduced a trap composed of 19 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 01:01:40] [INFO ] Deduced a trap composed of 20 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 01:01:41] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:41] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:41] [INFO ] Deduced a trap composed of 23 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 01:01:42] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 6/339 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 01:01:46] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:47] [INFO ] Deduced a trap along path composed of 5 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 341 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 2/2 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/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 53/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/407 variables, 229/339 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 177/516 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 01:01:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:51] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:01:51] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 4/520 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 01:01:55] [INFO ] Deduced a trap composed of 27 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 01:01:56] [INFO ] Deduced a trap composed of 28 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 01:01:56] [INFO ] Deduced a trap composed of 29 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 01:01:56] [INFO ] Deduced a trap composed of 30 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 01:01:56] [INFO ] Deduced a trap composed of 31 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 01:01:56] [INFO ] Deduced a trap composed of 32 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 01:01:57] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 529 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 229/256 places, 178/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60808 ms. Remains : 229/256 places, 178/215 transitions.
[2025-05-31 01:02:17] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:02:17] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:02:17] [INFO ] Input system was already deterministic with 178 transitions.
[2025-05-31 01:02:17] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:02:17] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:02:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18168026678243334539.gal : 1 ms
[2025-05-31 01:02:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4739381057501656594.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/CTLFireability18168026678243334539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4739381057501656594.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 01:02:47] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:02:47] [INFO ] Applying decomposition
[2025-05-31 01:02:47] [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/graph12285928733622357509.txt' '-o' '/tmp/graph12285928733622357509.bin' '-w' '/tmp/graph12285928733622357509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12285928733622357509.bin' '-l' '-1' '-v' '-w' '/tmp/graph12285928733622357509.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:02:47] [INFO ] Decomposing Gal with order
[2025-05-31 01:02:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:02:47] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 01:02:47] [INFO ] Flatten gal took : 12 ms
[2025-05-31 01:02:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-05-31 01:02:47] [INFO ] Time to serialize gal into /tmp/CTLFireability4990688475587039532.gal : 7 ms
[2025-05-31 01:02:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9528946840726002790.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/CTLFireability4990688475587039532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9528946840726002790.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.33427e+17,1.23435,37200,2485,85,74845,1202,635,128141,93,3939,0
Converting to forward existential form...Done !
original formula: E(A(((i1.u5.p21==1)||((i8.i0.i2.u49.p187==1)&&(i8.i1.i1.u54.p216==1))) U EF(EG(((i10.u47.p181==1)&&(i9.u56.p212==1))))) U EF((((AX((i12.u...247
=> equivalent forward existential formula: [((((FwdU(FwdU(Init,!((E(!(E(TRUE U EG(((i10.u47.p181==1)&&(i9.u56.p212==1))))) U (!(((i1.u5.p21==1)||((i8.i0.i2...443
Reverse transition relation is NOT exact ! Due to transitions t54, t86, t138, t139, t171, i0.t120, i0.u3.t125, i0.u3.t126, i0.u4.t122, i0.u4.t123, i1.t116,...726
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 238 transition count 194
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 227 transition count 183
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 227 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 226 transition count 173
Applied a total of 72 rules in 18 ms. Remains 226 /256 variables (removed 30) and now considering 173/215 (removed 42) transitions.
// Phase 1: matrix 173 rows 226 cols
[2025-05-31 01:03:17] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:03:18] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-05-31 01:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:03:18] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-05-31 01:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:23] [INFO ] Deduced a trap composed of 11 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 01:03:23] [INFO ] Deduced a trap composed of 12 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 01:03:23] [INFO ] Deduced a trap composed of 29 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 01:03:23] [INFO ] Deduced a trap composed of 20 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 01:03:23] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:23] [INFO ] Deduced a trap composed of 21 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 01:03:24] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:24] [INFO ] Deduced a trap composed of 16 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 01:03:24] [INFO ] Deduced a trap composed of 17 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 01:03:24] [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 01:03:24] [INFO ] Deduced a trap composed of 9 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 01:03:24] [INFO ] Deduced a trap composed of 10 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 01:03:24] [INFO ] Deduced a trap composed of 13 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 01:03:25] [INFO ] Deduced a trap composed of 12 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 01:03:25] [INFO ] Deduced a trap composed of 13 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 01:03:25] [INFO ] Deduced a trap composed of 9 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 01:03:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:25] [INFO ] Deduced a trap composed of 28 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 01:03:25] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:26] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:26] [INFO ] Deduced a trap composed of 28 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 01:03:26] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:26] [INFO ] Deduced a trap composed of 16 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 01:03:26] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:27] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:28] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:28] [INFO ] Deduced a trap composed of 16 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 01:03:28] [INFO ] Deduced a trap composed of 17 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 01:03:28] [INFO ] Deduced a trap composed of 18 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 01:03:28] [INFO ] Deduced a trap composed of 19 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 01:03:28] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:30] [INFO ] Deduced a trap composed of 18 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 01:03:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 173/399 variables, 226/316 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:35] [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 01:03:35] [INFO ] Deduced a trap composed of 21 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 01:03:36] [INFO ] Deduced a trap composed of 17 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 01:03:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:36] [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 01:03:36] [INFO ] Deduced a trap composed of 17 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 01:03:37] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:37] [INFO ] Deduced a trap composed of 15 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 01:03:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:41] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:45] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 327 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 43/100 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:49] [INFO ] Deduced a trap composed of 20 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 01:03:49] [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 01:03:49] [INFO ] Deduced a trap composed of 22 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 01:03:49] [INFO ] Deduced a trap composed of 22 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 01:03:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/331 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/503 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:52] [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 01:03:52] [INFO ] Deduced a trap composed of 17 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 01:03:52] [INFO ] Deduced a trap composed of 18 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 01:03:52] [INFO ] Deduced a trap composed of 19 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 01:03:52] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:52] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:52] [INFO ] Deduced a trap composed of 21 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 01:03:52] [INFO ] Deduced a trap composed of 22 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 01:03:54] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:54] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:54] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:54] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:54] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 13/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:59] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:03:59] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:00] [INFO ] Deduced a trap composed of 27 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 01:04:00] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:01] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:04:09] [INFO ] Deduced a trap composed of 26 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 01:04:10] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 172 unsolved
SMT process timed out in 60035ms, After SMT, problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 173/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60760 ms. Remains : 226/256 places, 173/215 transitions.
[2025-05-31 01:04:18] [INFO ] Flatten gal took : 8 ms
[2025-05-31 01:04:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:04:18] [INFO ] Input system was already deterministic with 173 transitions.
[2025-05-31 01:04:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:04:18] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:04:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15486966537873518313.gal : 2 ms
[2025-05-31 01:04:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11139053838036745731.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/CTLFireability15486966537873518313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11139053838036745731.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 01:04:48] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:04:48] [INFO ] Applying decomposition
[2025-05-31 01:04:48] [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/graph3771836046722981275.txt' '-o' '/tmp/graph3771836046722981275.bin' '-w' '/tmp/graph3771836046722981275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3771836046722981275.bin' '-l' '-1' '-v' '-w' '/tmp/graph3771836046722981275.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:04:48] [INFO ] Decomposing Gal with order
[2025-05-31 01:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:04:48] [INFO ] Removed a total of 11 redundant transitions.
[2025-05-31 01:04:48] [INFO ] Flatten gal took : 11 ms
[2025-05-31 01:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 01:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7612076274127563720.gal : 3 ms
[2025-05-31 01:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5746338081796738541.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/CTLFireability7612076274127563720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5746338081796738541.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.22197e+17,2.23556,56048,2489,87,104973,830,631,190805,94,2921,0
Converting to forward existential form...Done !
original formula: AF(((i5.u31.p127==1) * EX(((i7.u33.p133==0)||(i9.i0.i1.u36.p142==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(((i5.u31.p127==1) * EX(((i7.u33.p133==0)||(i9.i0.i1.u36.p142==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t52, t85, t134, t135, t167, i0.t117, i0.u3.t122, i0.u3.t123, i0.u4.t119, i0.u4.t120, i0....716
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Graph (complete) has 463 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 251 transition count 194
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 235 transition count 194
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 33 place count 235 transition count 187
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 47 place count 228 transition count 187
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 56 place count 219 transition count 178
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 219 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 219 transition count 177
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 70 place count 215 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 215 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 215 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 215 transition count 169
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 214 transition count 169
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 171 place count 168 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 168 transition count 122
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 177 place count 168 transition count 122
Applied a total of 177 rules in 67 ms. Remains 168 /256 variables (removed 88) and now considering 122/215 (removed 93) transitions.
// Phase 1: matrix 122 rows 168 cols
[2025-05-31 01:05:18] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:19] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-05-31 01:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 01:05:19] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 456 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 167/256 places, 122/215 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 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 166 transition count 121
Applied a total of 2 rules in 7 ms. Remains 166 /167 variables (removed 1) and now considering 121/122 (removed 1) transitions.
// Phase 1: matrix 121 rows 166 cols
[2025-05-31 01:05:19] [INFO ] Computed 56 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:19] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-31 01:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:05:19] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 166/256 places, 121/215 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1103 ms. Remains : 166/256 places, 121/215 transitions.
[2025-05-31 01:05:19] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:05:19] [INFO ] Flatten gal took : 9 ms
[2025-05-31 01:05:20] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-31 01:05:20] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:05:20] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:05:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6484494231250660836.gal : 1 ms
[2025-05-31 01:05:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13953765938911909429.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/CTLFireability6484494231250660836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13953765938911909429.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 01:05:50] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:05:50] [INFO ] Applying decomposition
[2025-05-31 01:05:50] [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/graph16518067788910074649.txt' '-o' '/tmp/graph16518067788910074649.bin' '-w' '/tmp/graph16518067788910074649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16518067788910074649.bin' '-l' '-1' '-v' '-w' '/tmp/graph16518067788910074649.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:05:50] [INFO ] Decomposing Gal with order
[2025-05-31 01:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:05:50] [INFO ] Removed a total of 36 redundant transitions.
[2025-05-31 01:05:50] [INFO ] Flatten gal took : 13 ms
[2025-05-31 01:05:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2025-05-31 01:05:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15922449372702011430.gal : 3 ms
[2025-05-31 01:05:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4244781129495521891.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/CTLFireability15922449372702011430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4244781129495521891.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.49658e+13,0.80076,21556,1506,97,37017,451,537,48761,109,1260,0
Converting to forward existential form...Done !
original formula: (A(((!(((A(((i3.u12.p90==1)&&(i3.u12.p92==1)) U (i6.i1.u19.p129==1)) + EF(((i0.u3.p27==1)&&(i4.u16.p113==1)))) * (A(((i4.u14.p93==1)&&(i4...962
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !((E(!(!(!((E(!((E((i5.u18.p119==1) U (i11.i3.u27.p143==1)) + ((i2.u10.p68==1)&&(i3.u13.p89...3999
Reverse transition relation is NOT exact ! Due to transitions t46, t81, t82, t98, t109, t110, t111, u7.t27, i0.u2.t32, i2.u0.t40, i2.u11.t22, i2.u11.t116, ...437
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Graph (complete) has 463 edges and 256 vertex of which 252 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 251 transition count 198
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 239 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 236 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 31 place count 236 transition count 188
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 45 place count 229 transition count 188
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 56 place count 218 transition count 177
Iterating global reduction 3 with 11 rules applied. Total rules applied 67 place count 218 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 218 transition count 174
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 76 place count 212 transition count 168
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 212 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 89 place count 212 transition count 161
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 91 place count 211 transition count 160
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 205 place count 154 transition count 103
Applied a total of 205 rules in 30 ms. Remains 154 /256 variables (removed 102) and now considering 103/215 (removed 112) transitions.
// Phase 1: matrix 103 rows 154 cols
[2025-05-31 01:06:20] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:20] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-31 01:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 01:06:20] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 430 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 153/256 places, 103/215 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 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 152 transition count 102
Applied a total of 2 rules in 6 ms. Remains 152 /153 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 152 cols
[2025-05-31 01:06:20] [INFO ] Computed 56 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:20] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-31 01:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:06:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 01:06:21] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 152/256 places, 102/215 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 855 ms. Remains : 152/256 places, 102/215 transitions.
[2025-05-31 01:06:21] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:06:21] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:06:21] [INFO ] Input system was already deterministic with 102 transitions.
[2025-05-31 01:06:21] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:06:21] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:06:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13319696796480282592.gal : 1 ms
[2025-05-31 01:06:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9556521818304781923.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/CTLFireability13319696796480282592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9556521818304781923.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 01:06:51] [INFO ] Flatten gal took : 8 ms
[2025-05-31 01:06:51] [INFO ] Applying decomposition
[2025-05-31 01:06:51] [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/graph16326654812889604238.txt' '-o' '/tmp/graph16326654812889604238.bin' '-w' '/tmp/graph16326654812889604238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16326654812889604238.bin' '-l' '-1' '-v' '-w' '/tmp/graph16326654812889604238.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:06:51] [INFO ] Decomposing Gal with order
[2025-05-31 01:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:06:51] [INFO ] Removed a total of 17 redundant transitions.
[2025-05-31 01:06:51] [INFO ] Flatten gal took : 17 ms
[2025-05-31 01:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 01:06:51] [INFO ] Time to serialize gal into /tmp/CTLFireability12018362432125144433.gal : 3 ms
[2025-05-31 01:06:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8363373244923555017.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/CTLFireability12018362432125144433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8363373244923555017.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.4213e+12,0.583544,15060,1038,150,24574,500,474,34800,102,1039,0
Converting to forward existential form...Done !
original formula: A(A(!(A(((i12.u50.p260==1)&&(i4.u12.p88!=1)) U !(((i11.i0.u3.p39==1)||(i5.u2.p35==1))))) U (((i6.i2.u42.p199==1) * EG(E((i12.u50.p260==1)...530
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(E(((i5.u15.p110==1)||(((i4.u12.p94==1)&&(i4.u12.p96==1))&&(u6.p58==1))) U (i5.u7.p60==1...1836
Reverse transition relation is NOT exact ! Due to transitions t72, t91, t92, t94, t95, t96, t98, t99, u1.t32, u6.t26, i3.u0.t34, i3.u9.t23, i3.u10.t21, i4....372
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 238 transition count 194
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 227 transition count 183
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 227 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 69 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 226 transition count 173
Applied a total of 72 rules in 16 ms. Remains 226 /256 variables (removed 30) and now considering 173/215 (removed 42) transitions.
// Phase 1: matrix 173 rows 226 cols
[2025-05-31 01:07:21] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:07:21] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-31 01:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:07:21] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2025-05-31 01:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:26] [INFO ] Deduced a trap composed of 11 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 01:07:26] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:27] [INFO ] Deduced a trap composed of 29 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 01:07:27] [INFO ] Deduced a trap composed of 20 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 01:07:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:27] [INFO ] Deduced a trap composed of 21 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 01:07:27] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:27] [INFO ] Deduced a trap composed of 16 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 01:07:27] [INFO ] Deduced a trap composed of 17 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 01:07:27] [INFO ] Deduced a trap composed of 14 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 01:07:28] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:28] [INFO ] Deduced a trap composed of 10 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 01:07:28] [INFO ] Deduced a trap composed of 13 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 01:07:28] [INFO ] Deduced a trap composed of 12 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 01:07:28] [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 01:07:28] [INFO ] Deduced a trap composed of 9 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 01:07:28] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:29] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:29] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:29] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:29] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:29] [INFO ] Deduced a trap composed of 24 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 01:07:29] [INFO ] Deduced a trap composed of 16 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 01:07:30] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:31] [INFO ] Deduced a trap composed of 13 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 01:07:31] [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 01:07:31] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:31] [INFO ] Deduced a trap composed of 17 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 01:07:31] [INFO ] Deduced a trap composed of 18 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 01:07:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:34] [INFO ] Deduced a trap composed of 18 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 01:07:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (OVERLAPS) 173/399 variables, 226/316 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:40] [INFO ] Deduced a trap composed of 20 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 01:07:40] [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 01:07:40] [INFO ] Deduced a trap composed of 17 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 01:07:41] [INFO ] Deduced a trap composed of 15 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 01:07:41] [INFO ] Deduced a trap composed of 19 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 01:07:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:42] [INFO ] Deduced a trap composed of 15 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 01:07:42] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:46] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:50] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 327 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 43/100 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:53] [INFO ] Deduced a trap composed of 20 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 01:07:53] [INFO ] Deduced a trap composed of 21 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 01:07:53] [INFO ] Deduced a trap composed of 22 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 01:07:53] [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 01:07:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/331 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/503 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:55] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:56] [INFO ] Deduced a trap composed of 17 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 01:07:56] [INFO ] Deduced a trap composed of 18 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 01:07:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:56] [INFO ] Deduced a trap composed of 19 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 01:07:56] [INFO ] Deduced a trap composed of 20 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 01:07:56] [INFO ] Deduced a trap composed of 21 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 01:07:56] [INFO ] Deduced a trap composed of 22 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 01:07:57] [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 01:07:57] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:58] [INFO ] Deduced a trap composed of 20 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 01:07:58] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:07:58] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 13/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:02] [INFO ] Deduced a trap composed of 22 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 01:08:03] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:03] [INFO ] Deduced a trap composed of 27 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 01:08:04] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:12] [INFO ] Deduced a trap composed of 26 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 01:08:13] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:08:21] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 524 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60034ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60035ms
Starting structural reductions in LTL mode, iteration 1 : 226/256 places, 173/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 226/256 places, 173/215 transitions.
[2025-05-31 01:08:21] [INFO ] Flatten gal took : 9 ms
[2025-05-31 01:08:21] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:08:22] [INFO ] Input system was already deterministic with 173 transitions.
[2025-05-31 01:08:22] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:08:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:08:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8881511460521969539.gal : 1 ms
[2025-05-31 01:08:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3569211089111881235.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/CTLFireability8881511460521969539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3569211089111881235.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 01:08:52] [INFO ] Flatten gal took : 9 ms
[2025-05-31 01:08:52] [INFO ] Applying decomposition
[2025-05-31 01:08:52] [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/graph3026135901075581503.txt' '-o' '/tmp/graph3026135901075581503.bin' '-w' '/tmp/graph3026135901075581503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3026135901075581503.bin' '-l' '-1' '-v' '-w' '/tmp/graph3026135901075581503.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:08:52] [INFO ] Decomposing Gal with order
[2025-05-31 01:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:08:52] [INFO ] Removed a total of 10 redundant transitions.
[2025-05-31 01:08:52] [INFO ] Flatten gal took : 19 ms
[2025-05-31 01:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-05-31 01:08:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4644587807731648336.gal : 5 ms
[2025-05-31 01:08:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13465741559103038583.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/CTLFireability4644587807731648336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13465741559103038583.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.22197e+17,3.41801,73252,5121,85,161094,534,641,173856,90,1666,0
Converting to forward existential form...Done !
original formula: AF(EX(EX(AG(((i3.i0.u23.p80==1)||((i8.i0.u36.p149==1)&&(i8.i2.u44.p174==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX(!(E(TRUE U !(((i3.i0.u23.p80==1)||((i8.i0.u36.p149==1)&&(i8.i2.u44.p174==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t54, t85, t134, t135, t167, i0.t117, i0.u4.t122, i0.u4.t123, i0.u5.t119, i0.u5.t120, i0....730
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 256/256 places, 215/215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 242 transition count 201
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 242 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 242 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 233 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 233 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 56 place count 233 transition count 182
Applied a total of 56 rules in 12 ms. Remains 233 /256 variables (removed 23) and now considering 182/215 (removed 33) transitions.
// Phase 1: matrix 182 rows 233 cols
[2025-05-31 01:09:22] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:22] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-05-31 01:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:09:22] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-31 01:09: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/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 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 01:09:27] [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 01:09:28] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:28] [INFO ] Deduced a trap composed of 12 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 01:09:28] [INFO ] Deduced a trap composed of 17 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 01:09:28] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:28] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:28] [INFO ] Deduced a trap composed of 28 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 01:09:28] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 16 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 01:09:29] [INFO ] Deduced a trap composed of 17 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 01:09:29] [INFO ] Deduced a trap composed of 17 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 01:09:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:29] [INFO ] Deduced a trap composed of 18 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 01:09:29] [INFO ] Deduced a trap composed of 18 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 01:09:29] [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 01:09:29] [INFO ] Deduced a trap composed of 20 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 01:09:29] [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 01:09:30] [INFO ] Deduced a trap composed of 19 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 01:09:30] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 20/77 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 01:09:30] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:30] [INFO ] Deduced a trap composed of 11 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 01:09:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:31] [INFO ] Deduced a trap composed of 10 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 01:09:31] [INFO ] Deduced a trap composed of 12 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 01:09:31] [INFO ] Deduced a trap composed of 11 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 01:09:31] [INFO ] Deduced a trap composed of 13 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 01:09:31] [INFO ] Deduced a trap composed of 9 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 01:09:31] [INFO ] Deduced a trap composed of 10 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 01:09:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 10/87 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 01:09:32] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:32] [INFO ] Deduced a trap composed of 24 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 01:09:33] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 3/90 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 01:09:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:35] [INFO ] Deduced a trap composed of 28 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 01:09:35] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 3/93 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 01:09:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:36] [INFO ] Deduced a trap composed of 17 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 01:09:36] [INFO ] Deduced a trap composed of 18 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 01:09:37] [INFO ] Deduced a trap composed of 19 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 01:09:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/415 variables, 233/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 01:09:40] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:41] [INFO ] Deduced a trap composed of 17 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 01:09:41] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 5/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 01:09:43] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 1/337 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 01:09:48] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:49] [INFO ] Deduced a trap along path composed of 5 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:49] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/415 variables, and 340 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 3/3 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/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/415 variables, 233/337 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 181/518 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 01:09:55] [INFO ] Deduced a trap composed of 17 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 01:09:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:55] [INFO ] Deduced a trap composed of 13 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 01:09:55] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:09:56] [INFO ] Deduced a trap composed of 25 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 01:09:56] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 7/525 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 01:10:01] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:02] [INFO ] Deduced a trap composed of 23 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 01:10:02] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:02] [INFO ] Deduced a trap composed of 24 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 01:10:03] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:03] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:04] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 7/532 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 01:10:10] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:10] [INFO ] Deduced a trap composed of 26 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 01:10:10] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:11] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:10:11] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 5/537 constraints. Problems are: Problem set: 0 solved, 181 unsolved
SMT process timed out in 60037ms, After SMT, problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 233/256 places, 182/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 233/256 places, 182/215 transitions.
[2025-05-31 01:10:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:10:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:10:22] [INFO ] Input system was already deterministic with 182 transitions.
[2025-05-31 01:10:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:10:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:10:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1525335765655164179.gal : 1 ms
[2025-05-31 01:10:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1549175184238502204.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/CTLFireability1525335765655164179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1549175184238502204.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 01:10:52] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:10:52] [INFO ] Applying decomposition
[2025-05-31 01:10:52] [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/graph7707749978069073859.txt' '-o' '/tmp/graph7707749978069073859.bin' '-w' '/tmp/graph7707749978069073859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7707749978069073859.bin' '-l' '-1' '-v' '-w' '/tmp/graph7707749978069073859.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:10:52] [INFO ] Decomposing Gal with order
[2025-05-31 01:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:10:53] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 01:10:53] [INFO ] Flatten gal took : 12 ms
[2025-05-31 01:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-05-31 01:10:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6372780881342675074.gal : 3 ms
[2025-05-31 01:10:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17517196802929658460.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/CTLFireability6372780881342675074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17517196802929658460.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,8.72704e+17,1.76869,43932,2568,76,92419,646,684,121209,92,2087,0
Converting to forward existential form...Done !
original formula: EF((((EF((i12.i1.u74.p257==1)) + A((EF((i2.i0.u11.p45==1)) * (i8.i0.u40.p140!=1)) U AX((i3.i1.u18.p67==1)))) + AX((i6.u32.p122==1))) * ((...454
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * ((E(TRUE U (i12.i1.u74.p257==1)) + !((E(!(!(EX(!((i3.i1.u18.p67==1))))) U (!((E(TRUE U (...1730
Reverse transition relation is NOT exact ! Due to transitions t53, t61, t86, t90, t142, t143, i0.t127, i0.t123, i0.u3.t129, i0.u3.t130, i0.u4.t125, i1.i1.t...799
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 197
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 238 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 230 transition count 186
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 230 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 230 transition count 181
Applied a total of 60 rules in 12 ms. Remains 230 /256 variables (removed 26) and now considering 181/215 (removed 34) transitions.
// Phase 1: matrix 181 rows 230 cols
[2025-05-31 01:11:23] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:11:23] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-31 01:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:11:23] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-05-31 01:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:29] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:29] [INFO ] Deduced a trap composed of 12 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 01:11:29] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:30] [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 01:11:30] [INFO ] Deduced a trap composed of 29 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 01:11:30] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:30] [INFO ] Deduced a trap composed of 16 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 01:11:30] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 17 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 01:11:31] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 18 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 01:11:31] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:31] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:32] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:32] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:32] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:32] [INFO ] Deduced a trap composed of 24 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 01:11:32] [INFO ] Deduced a trap composed of 28 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 01:11:32] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:32] [INFO ] Deduced a trap composed of 14 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 01:11:33] [INFO ] Deduced a trap composed of 15 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 01:11:33] [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 01:11:33] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:33] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:33] [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 01:11:33] [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 01:11:33] [INFO ] Deduced a trap composed of 21 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 01:11:33] [INFO ] Deduced a trap composed of 22 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 01:11:33] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:33] [INFO ] Deduced a trap composed of 22 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 01:11:33] [INFO ] Deduced a trap composed of 23 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 01:11:33] [INFO ] Deduced a trap composed of 10 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 01:11:33] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:34] [INFO ] Deduced a trap composed of 28 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 01:11:34] [INFO ] Deduced a trap composed of 12 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 01:11:34] [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 01:11:35] [INFO ] Deduced a trap composed of 9 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 01:11:35] [INFO ] Deduced a trap composed of 10 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 01:11:35] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 181/411 variables, 230/335 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:44] [INFO ] Deduced a trap composed of 15 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 01:11:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:48] [INFO ] Deduced a trap along path composed of 5 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:49] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:49] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 341 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 181/411 variables, 230/339 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 180/519 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:57] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:11:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:03] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:06] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:10] [INFO ] Deduced a trap composed of 21 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 01:12:12] [INFO ] Deduced a trap composed of 22 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 01:12:12] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:12:19] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 527 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 230/256 places, 181/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60673 ms. Remains : 230/256 places, 181/215 transitions.
[2025-05-31 01:12:23] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:12:23] [INFO ] Flatten gal took : 8 ms
[2025-05-31 01:12:23] [INFO ] Input system was already deterministic with 181 transitions.
[2025-05-31 01:12:23] [INFO ] Flatten gal took : 8 ms
[2025-05-31 01:12:23] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:12:23] [INFO ] Time to serialize gal into /tmp/CTLFireability782647625687179040.gal : 1 ms
[2025-05-31 01:12:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4977125810180830035.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/CTLFireability782647625687179040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4977125810180830035.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-31 01:12:53] [INFO ] Flatten gal took : 8 ms
[2025-05-31 01:12:53] [INFO ] Applying decomposition
[2025-05-31 01:12:53] [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/graph15608409530075195097.txt' '-o' '/tmp/graph15608409530075195097.bin' '-w' '/tmp/graph15608409530075195097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15608409530075195097.bin' '-l' '-1' '-v' '-w' '/tmp/graph15608409530075195097.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:12:53] [INFO ] Decomposing Gal with order
[2025-05-31 01:12:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:12:53] [INFO ] Removed a total of 18 redundant transitions.
[2025-05-31 01:12:53] [INFO ] Flatten gal took : 16 ms
[2025-05-31 01:12:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2025-05-31 01:12:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9296049355020095397.gal : 5 ms
[2025-05-31 01:12:53] [INFO ] Time to serialize properties into /tmp/CTLFireability2283014567336974766.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/CTLFireability9296049355020095397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2283014567336974766.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.22329e+17,1.47423,32536,2128,84,62133,711,682,106580,97,2430,0
Converting to forward existential form...Done !
original formula: !(E(E(((((E(((i4.i1.u24.p94==1)&&(i5.u25.p96==1)) U (i12.i0.u74.p262==1)) + !((((i2.i1.u12.p48==1)&&(i12.i0.u72.p250==1))&&(i9.i3.u54.p19...542
=> equivalent forward existential formula: (([(FwdU(Init,E(((((E(((i4.i1.u24.p94==1)&&(i5.u25.p96==1)) U (i12.i0.u74.p262==1)) + !((((i2.i1.u12.p48==1)&&(i...1407
Reverse transition relation is NOT exact ! Due to transitions t50, t56, t85, t121, t142, t143, t175, i0.u76.t15, i1.i1.t130, i1.i1.u5.t114, i2.i0.u3.t127, ...766
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 215/215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 240 transition count 199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 240 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 240 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 230 transition count 186
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 230 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 230 transition count 179
Applied a total of 62 rules in 12 ms. Remains 230 /256 variables (removed 26) and now considering 179/215 (removed 36) transitions.
// Phase 1: matrix 179 rows 230 cols
[2025-05-31 01:13:24] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:13:24] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 01:13:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:13:24] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-05-31 01:13: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/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:29] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:29] [INFO ] Deduced a trap composed of 12 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 01:13:29] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:29] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:29] [INFO ] Deduced a trap composed of 22 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 01:13:30] [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 01:13:30] [INFO ] Deduced a trap composed of 16 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 01:13:30] [INFO ] Deduced a trap composed of 17 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 01:13:30] [INFO ] Deduced a trap composed of 14 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 01:13:30] [INFO ] Deduced a trap composed of 9 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 01:13:30] [INFO ] Deduced a trap composed of 10 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 01:13:30] [INFO ] Deduced a trap composed of 13 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 01:13:31] [INFO ] Deduced a trap composed of 12 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 01:13:31] [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 01:13:31] [INFO ] Deduced a trap composed of 9 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 01:13:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:31] [INFO ] Deduced a trap composed of 13 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 01:13:31] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:31] [INFO ] Deduced a trap composed of 15 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 01:13:32] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:32] [INFO ] Deduced a trap composed of 28 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 01:13:32] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:32] [INFO ] Deduced a trap composed of 23 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 01:13:33] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:33] [INFO ] Deduced a trap composed of 16 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 01:13:33] [INFO ] Deduced a trap composed of 18 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 01:13:33] [INFO ] Deduced a trap composed of 17 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 01:13:33] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:37] [INFO ] Deduced a trap composed of 16 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 01:13:37] [INFO ] Deduced a trap composed of 17 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 01:13:37] [INFO ] Deduced a trap composed of 18 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 01:13:37] [INFO ] Deduced a trap composed of 19 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 01:13:37] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 179/409 variables, 230/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:42] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13: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 01:13:42] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:43] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:43] [INFO ] Deduced a trap composed of 19 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 01:13:43] [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 01:13:43] [INFO ] Deduced a trap composed of 20 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 01:13:43] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:43] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:43] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:43] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:44] [INFO ] Deduced a trap composed of 11 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 01:13:44] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 13/334 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:46] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:46] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 0/409 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 336 constraints, problems are : Problem set: 0 solved, 178 unsolved in 29616 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 49/106 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:55] [INFO ] Deduced a trap composed of 21 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 01:13:55] [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 01:13:55] [INFO ] Deduced a trap composed of 22 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 01:13:56] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:13:57] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 179/409 variables, 230/341 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 178/519 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:01] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:01] [INFO ] Deduced a trap composed of 24 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 01:14:01] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:13] [INFO ] Deduced a trap along path composed of 3 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:13] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 01:14:13] [INFO ] Deduced a trap along path composed of 3 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 01:14:20] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 526 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 59645ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 59646ms
Starting structural reductions in LTL mode, iteration 1 : 230/256 places, 179/215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60207 ms. Remains : 230/256 places, 179/215 transitions.
[2025-05-31 01:14:24] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:14:24] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:14:24] [INFO ] Input system was already deterministic with 179 transitions.
[2025-05-31 01:14:24] [INFO ] Flatten gal took : 7 ms
[2025-05-31 01:14:24] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:14:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13257506321313647624.gal : 2 ms
[2025-05-31 01:14:24] [INFO ] Time to serialize properties into /tmp/CTLFireability761782573410733543.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/CTLFireability13257506321313647624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability761782573410733543.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 01:14:54] [INFO ] Flatten gal took : 4 ms
[2025-05-31 01:14:54] [INFO ] Applying decomposition
[2025-05-31 01:14:54] [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/graph8549961535084593217.txt' '-o' '/tmp/graph8549961535084593217.bin' '-w' '/tmp/graph8549961535084593217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8549961535084593217.bin' '-l' '-1' '-v' '-w' '/tmp/graph8549961535084593217.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:14:54] [INFO ] Decomposing Gal with order
[2025-05-31 01:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:14:54] [INFO ] Removed a total of 12 redundant transitions.
[2025-05-31 01:14:54] [INFO ] Flatten gal took : 9 ms
[2025-05-31 01:14:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-05-31 01:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7226226154036700709.gal : 3 ms
[2025-05-31 01:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14060552796951958584.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/CTLFireability7226226154036700709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14060552796951958584.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.93732e+17,2.94904,65356,3880,75,123168,593,611,246613,85,1925,0
Converting to forward existential form...Done !
original formula: EG(EX(((EF(EX((i3.u27.p108==1))) + (((i1.u6.p37==1)&&(i3.u26.p98==1))&&(((i6.u41.p151==0)||(i6.u48.p177==0))&&(((i4.u34.p138==1)||(i1.u7....305
=> equivalent forward existential formula: [FwdG(Init,EX(((E(TRUE U EX((i3.u27.p108==1))) + (((i1.u6.p37==1)&&(i3.u26.p98==1))&&(((i6.u41.p151==0)||(i6.u48...360
Reverse transition relation is NOT exact ! Due to transitions t48, t54, t139, t140, i0.t122, i0.u3.t127, i0.u3.t128, i0.u4.t124, i0.u4.t125, i0.u9.t112, i0...724
Detected timeout of ITS tools.
[2025-05-31 01:15:24] [INFO ] Flatten gal took : 5 ms
[2025-05-31 01:15:24] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:15:24] [INFO ] Applying decomposition
[2025-05-31 01:15:24] [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/graph8053855795064642558.txt' '-o' '/tmp/graph8053855795064642558.bin' '-w' '/tmp/graph8053855795064642558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8053855795064642558.bin' '-l' '-1' '-v' '-w' '/tmp/graph8053855795064642558.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:15:24] [INFO ] Decomposing Gal with order
[2025-05-31 01:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:15:24] [INFO ] Removed a total of 28 redundant transitions.
[2025-05-31 01:15:24] [INFO ] Flatten gal took : 14 ms
[2025-05-31 01:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 3 ms.
[2025-05-31 01:15:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15241575096991329256.gal : 4 ms
[2025-05-31 01:15:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9228793320559916034.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/CTLFireability15241575096991329256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9228793320559916034.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 14 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,9.74402e+18,7.78256,166420,8676,77,366320,662,695,448360,95,2231,0
Converting to forward existential form...Done !
original formula: AF(((EF(AX((i1.u6.p20==0))) * (i12.i1.u63.p196==1)) * (((i7.u29.p88==1)||(i2.i0.u9.p25==0))||((i8.u35.p113==0)||((i1.u5.p16==0)&&((i6.i1....190
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(EX(!((i1.u6.p20==0))))) * (i12.i1.u63.p196==1)) * (((i7.u29.p88==1)||(i2.i0.u9.p25==0)...247
Reverse transition relation is NOT exact ! Due to transitions t55, t57, t92, t142, t170, t171, i0.u4.t150, i0.u4.t152, i1.t148, i1.u5.t144, i1.u5.t146, i2....950
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 01:17:36] [INFO ] Applying decomposition
[2025-05-31 01:17:36] [INFO ] Flatten gal took : 6 ms
[2025-05-31 01:17:36] [INFO ] Decomposing Gal with order
[2025-05-31 01:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:17:36] [INFO ] Removed a total of 20 redundant transitions.
[2025-05-31 01:17:36] [INFO ] Flatten gal took : 14 ms
[2025-05-31 01:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 10 ms.
[2025-05-31 01:17:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5559644206957938393.gal : 4 ms
[2025-05-31 01:17:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15276136941130310460.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/CTLFireability5559644206957938393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15276136941130310460.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 14 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,9.74402e+18,31.5606,644372,12421,307,713996,1457,594,6.30932e+06,143,5902,0
Converting to forward existential form...Done !
original formula: AF(((EF(AX((i0.i0.i0.i0.i0.i0.u8.p20==0))) * (i1.i0.i1.i0.i0.i1.i0.i1.u100.p196==1)) * (((i0.i1.i0.i1.i0.i1.u114.p88==1)||(i0.i0.i0.i0.i0...296
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(EX(!((i0.i0.i0.i0.i0.i0.u8.p20==0))))) * (i1.i0.i1.i0.i0.i1.i0.i1.u100.p196==1)) * (((...353
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u12.t113, i0.i0.u12.t115, i0.i0.i0.u11.t118, i0.i0.i0.u11.t120, i0.i0.i0.u11.t122, i0.i...1851
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-31 01:29:05] [INFO ] Flatten gal took : 9 ms
[2025-05-31 01:29:05] [INFO ] Input system was already deterministic with 215 transitions.
[2025-05-31 01:29:05] [INFO ] Transformed 256 places.
[2025-05-31 01:29:05] [INFO ] Transformed 215 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 01:29:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1331695204666472297.gal : 2 ms
[2025-05-31 01:29:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6059060393948575147.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/CTLFireability1331695204666472297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6059060393948575147.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 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,9.74402e+18,14.9014,306720,2,74412,5,1.22459e+06,6,0,1239,1.43714e+06,0
Converting to forward existential form...Done !
original formula: AF(((EF(AX((p20==0))) * (p196==1)) * (((p88==1)||(p25==0))||((p113==0)||((p16==0)&&((p74==0)||(p111==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(EX(!((p20==0))))) * (p196==1)) * (((p88==1)||(p25==0))||((p113==0)||((p16==0)&&((p74==...184
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t9, t15, t21, t24, t33, t36, t47, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t...493
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-00b"
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-00b, 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-174854063800226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00b.tgz
mv DES-PT-00b 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 ;