About the Execution of ITS-Tools for ShieldIIPt-PT-005B
| 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 | F??F?F?????????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532800498.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 ShieldIIPt-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532800498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 83K 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 ShieldIIPt-PT-005B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-15
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-00
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-01
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-02
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-03
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-04
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-05
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-06
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-07
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-08
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-09
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-10
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749123658079
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 11:40: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-06-05 11:40:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:40:59] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-06-05 11:40:59] [INFO ] Transformed 353 places.
[2025-06-05 11:40:59] [INFO ] Transformed 328 transitions.
[2025-06-05 11:40:59] [INFO ] Found NUPN structural information;
[2025-06-05 11:40:59] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 145 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 328/328 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 302
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 302
Applied a total of 52 rules in 56 ms. Remains 327 /353 variables (removed 26) and now considering 302/328 (removed 26) transitions.
// Phase 1: matrix 302 rows 327 cols
[2025-06-05 11:40:59] [INFO ] Computed 46 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:59] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-05 11:40:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:41:00] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-05 11:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:04] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [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-06-05 11:41:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:05] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:06] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [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-06-05 11:41:07] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:08] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [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-06-05 11:41:11] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/629 variables, 327/426 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:20] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:24] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:25] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:25] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 436 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 60/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/629 variables, 327/433 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 301/734 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:34] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:36] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:36] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:37] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:38] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:38] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:38] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:38] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:39] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:40] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:40] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 17/771 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:43] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:44] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:44] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:44] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:46] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:46] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:47] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:47] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:47] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:47] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 11/782 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:55] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:55] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:41:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 3/785 constraints. Problems are: Problem set: 0 solved, 301 unsolved
SMT process timed out in 60108ms, After SMT, problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 327/353 places, 302/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60751 ms. Remains : 327/353 places, 302/328 transitions.
Support contains 145 out of 327 places after structural reductions.
[2025-06-05 11:42:00] [INFO ] Flatten gal took : 40 ms
[2025-06-05 11:42:00] [INFO ] Flatten gal took : 18 ms
[2025-06-05 11:42:00] [INFO ] Input system was already deterministic with 302 transitions.
RANDOM walk for 40000 steps (8 resets) in 1429 ms. (27 steps per ms) remains 9/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
[2025-06-05 11:42:01] [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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 123/133 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 194/327 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 302/629 variables, 327/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/629 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 373 constraints, problems are : Problem set: 0 solved, 4 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 123/133 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 194/327 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:01] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [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-06-05 11:42:02] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 302/629 variables, 327/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 7 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:02] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:03] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 6/400 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/629 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/629 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 401 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1916 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2162ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 882 ms.
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 327 transition count 243
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 268 transition count 241
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 267 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 264 transition count 238
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 127 place count 264 transition count 211
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 181 place count 237 transition count 211
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 202 place count 216 transition count 190
Iterating global reduction 4 with 21 rules applied. Total rules applied 223 place count 216 transition count 190
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 223 place count 216 transition count 174
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 255 place count 200 transition count 174
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 413 place count 121 transition count 95
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 435 place count 110 transition count 101
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 436 place count 110 transition count 100
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 441 place count 110 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 442 place count 109 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 444 place count 107 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 444 place count 107 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 446 place count 106 transition count 98
Applied a total of 446 rules in 69 ms. Remains 106 /327 variables (removed 221) and now considering 98/302 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 106/327 places, 98/302 transitions.
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
// Phase 1: matrix 98 rows 106 cols
[2025-06-05 11:42:04] [INFO ] Computed 44 invariants in 1 ms
[2025-06-05 11:42:04] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/69 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/114 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/118 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/122 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/170 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/170 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/170 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/171 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/171 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/171 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/173 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/173 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 23/196 variables, 14/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/196 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/197 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/197 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/198 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/198 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/198 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 6/204 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/204 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/204 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/204 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/69 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/114 variables, 22/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/118 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/122 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 48/170 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/170 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/170 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/171 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/171 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/171 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/173 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/173 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 23/196 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/196 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/197 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/197 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/197 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/198 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/198 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/198 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 6/204 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/204 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/204 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/204 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 106/106 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 106 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 102 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 100 transition count 96
Applied a total of 12 rules in 7 ms. Remains 100 /106 variables (removed 6) and now considering 96/98 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/106 places, 96/98 transitions.
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 532596 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 2
Probabilistic random walk after 532596 steps, saw 370269 distinct states, run finished after 3014 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 96 rows 100 cols
[2025-06-05 11:42:08] [INFO ] Computed 44 invariants in 1 ms
[2025-06-05 11:42:08] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/108 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/110 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/114 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/162 variables, 28/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/163 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/163 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/165 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/165 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 23/188 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/188 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/188 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/188 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/189 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/189 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/189 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/190 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/190 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/190 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 6/196 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/196 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/196 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/196 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 100/100 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/108 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/110 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/114 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 48/162 variables, 28/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/163 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/163 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/165 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/165 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 23/188 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/188 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/188 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/188 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/189 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/189 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/189 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/190 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/190 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/190 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 6/196 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/196 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/196 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/196 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 100/100 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 100/100 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-05 11:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:08] [INFO ] Implicit Places using invariants in 78 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/100 places, 96/96 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 95
Applied a total of 2 rules in 5 ms. Remains 98 /99 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 98 cols
[2025-06-05 11:42:08] [INFO ] Computed 43 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 11:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 11:42:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/100 places, 95/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 250 ms. Remains : 98/100 places, 95/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 667528 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 2
Probabilistic random walk after 667528 steps, saw 475078 distinct states, run finished after 3004 ms. (steps per millisecond=222 ) properties seen :0
[2025-06-05 11:42:12] [INFO ] Invariant cache hit.
[2025-06-05 11:42:12] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/108 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/110 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/114 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/162 variables, 28/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/163 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/163 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/165 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/165 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 22/187 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/187 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/187 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/193 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/193 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/193 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/193 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 98/98 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/63 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/108 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/110 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/114 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 48/162 variables, 28/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/163 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/163 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/165 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/165 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 22/187 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/187 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/187 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 6/193 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/193 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/193 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 98/98 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-05 11:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 11:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-05 11:42:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:42:12] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-05 11:42:12] [INFO ] Invariant cache hit.
[2025-06-05 11:42:12] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 2/98 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:13] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 95/193 variables, 98/146 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 153 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 98/98 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 2/98 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 95/193 variables, 98/146 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 90/243 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 7/251 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:18] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 252 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6977 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 98/98 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 9278ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9465 ms. Remains : 98/98 places, 95/95 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 98 transition count 95
Applied a total of 12 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 95 rows 98 cols
[2025-06-05 11:42:21] [INFO ] Computed 43 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:42:21] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 11:42:22] [INFO ] [Nat]Absence check using 43 positive place invariants in 5 ms returned sat
[2025-06-05 11:42:22] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 11:42:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-05 11:42:22] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-05 11:42:22] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 11:42:22] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 156 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-05 11:42:22] [INFO ] Flatten gal took : 26 ms
[2025-06-05 11:42:22] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:42:22] [INFO ] Input system was already deterministic with 302 transitions.
Computed a total of 90 stabilizing places and 90 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 10 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
// Phase 1: matrix 274 rows 299 cols
[2025-06-05 11:42:22] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:22] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 11:42:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:22] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-05 11:42: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/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [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-06-05 11:42:28] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [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-06-05 11:42:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:31] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 274/573 variables, 299/380 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:37] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:42] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:42] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 273 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 573/573 variables, and 390 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 43/89 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/573 variables, 299/388 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 273/661 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:54] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:54] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:55] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:55] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:55] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:55] [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-06-05 11:42:55] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:57] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:57] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 20/681 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:57] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:42:59] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:00] [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-06-05 11:43:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 11/692 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:01] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:02] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:02] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:03] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:03] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:03] [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-06-05 11:43:03] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:04] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 11/703 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:08] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:08] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:43:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 3/706 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 708 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 299/327 places, 274/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60322 ms. Remains : 299/327 places, 274/302 transitions.
[2025-06-05 11:43:22] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:43:22] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:43:22] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-05 11:43:22] [INFO ] Flatten gal took : 15 ms
[2025-06-05 11:43:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1868182868363964335.gal : 9 ms
[2025-06-05 11:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2044466005555550581.ctl : 16 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/CTLFireability1868182868363964335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2044466005555550581.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5212e+28,22.8782,657816,2,5410,5,1.66058e+06,6,0,1472,5.05041e+06,0
Converting to forward existential form...Done !
original formula: EF(((E(!(A(AG(((p87==1)&&(p120==1))) U EX(((p93==1)&&(p132==1))))) U A(AX((p212==1)) U !(EG((p251==1))))) * (EG(((p42==1)||((p229==1)&&(p...321
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (E(!(!((E(!(EX(((p93==1)&&(p132==1)))) U (!(!(E(TRUE U !(((p87==1)&&(p120==1)))))) * !(EX...1037
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...603
Detected timeout of ITS tools.
[2025-06-05 11:43:52] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:43:52] [INFO ] Applying decomposition
[2025-06-05 11:43:52] [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/graph11522914174409471326.txt' '-o' '/tmp/graph11522914174409471326.bin' '-w' '/tmp/graph11522914174409471326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11522914174409471326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11522914174409471326.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:43:52] [INFO ] Decomposing Gal with order
[2025-06-05 11:43:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:43:52] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-05 11:43:53] [INFO ] Flatten gal took : 65 ms
[2025-06-05 11:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2025-06-05 11:43:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6040213639603491520.gal : 16 ms
[2025-06-05 11:43:53] [INFO ] Time to serialize properties into /tmp/CTLFireability18365163608368687491.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/CTLFireability6040213639603491520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18365163608368687491.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5212e+28,3.2776,87152,887,43,138571,519,635,450217,61,1411,0
Converting to forward existential form...Done !
original formula: EF(((E(!(A(AG(((i7.i1.u29.p87==1)&&(i6.i1.u38.p120==1))) U EX(((i6.i0.u31.p93==1)&&(i5.u41.p132==1))))) U A(AX((i11.i2.u66.p212==1)) U !(...504
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (E(!(!((E(!(EX(((i6.i0.u31.p93==1)&&(i5.u41.p132==1)))) U (!(!(E(TRUE U !(((i7.i1.u29.p87...1484
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t133, t177, t220, i0.i1.u2.t226, i0.i1.u10.t221, i0.i2.t188, i0.i2.u24.t184, i1.t21...1166
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 299 transition count 274
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 299 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 298 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 298 transition count 273
Applied a total of 58 rules in 17 ms. Remains 298 /327 variables (removed 29) and now considering 273/302 (removed 29) transitions.
// Phase 1: matrix 273 rows 298 cols
[2025-06-05 11:44:23] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:44:23] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-05 11:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:44:23] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-05 11:44: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/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [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-06-05 11:44:27] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [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-06-05 11:44:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [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-06-05 11:44:27] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:28] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:29] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:30] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 273/571 variables, 298/382 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:39] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:52] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:53] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 389 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 43/89 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:54] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 273/571 variables, 298/390 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 272/662 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:57] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:57] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:57] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:57] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:57] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:58] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:58] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:58] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:58] [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-06-05 11:44:59] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [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-06-05 11:44:59] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:44:59] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:00] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:00] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 20/682 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:00] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:01] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:01] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:01] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:02] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:02] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:02] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:03] [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-06-05 11:45:03] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:03] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:03] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:03] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 14/696 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:06] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:07] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:07] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 3/699 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:11] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:20] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60053ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 298/327 places, 273/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60357 ms. Remains : 298/327 places, 273/302 transitions.
[2025-06-05 11:45:23] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:45:23] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:45:23] [INFO ] Input system was already deterministic with 273 transitions.
[2025-06-05 11:45:23] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:45:23] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:45:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8194552840483945715.gal : 2 ms
[2025-06-05 11:45:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13316423450126932813.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/CTLFireability8194552840483945715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13316423450126932813.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4288e+28,17.4945,485232,2,4885,5,1.30162e+06,6,0,1467,3.59362e+06,0
Converting to forward existential form...Done !
original formula: AG(((EX((p101==0)) + (p276==1)) + ((p2==1)&&(p55==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p2==1)&&(p55==1)))) * !((p276==1))) * !(EX((p101==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t55, t60,...596
(forward)formula 0,0,19.9414,485232,1,0,575,1.30162e+06,566,279,7933,3.59362e+06,555
FORMULA ShieldIIPt-PT-005B-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 298 transition count 273
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 298 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 297 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 297 transition count 272
Applied a total of 60 rules in 10 ms. Remains 297 /327 variables (removed 30) and now considering 272/302 (removed 30) transitions.
// Phase 1: matrix 272 rows 297 cols
[2025-06-05 11:45:43] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:45:43] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-05 11:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:45:43] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 11:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [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-06-05 11:45:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:49] [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-06-05 11:45:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:50] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 272/569 variables, 297/377 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:45:56] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:00] [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-06-05 11:46:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:04] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:04] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 386 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/569 variables, 297/383 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 271/654 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:16] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:17] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [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-06-05 11:46:18] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:19] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/674 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:19] [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-06-05 11:46:20] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:20] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:20] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:20] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:21] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:21] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:21] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:22] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:22] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:22] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 13/687 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:24] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:26] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:26] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:27] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:29] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:37] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:46:37] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 271 unsolved
SMT process timed out in 60036ms, After SMT, problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 297/327 places, 272/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60325 ms. Remains : 297/327 places, 272/302 transitions.
[2025-06-05 11:46:44] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:46:44] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:46:44] [INFO ] Input system was already deterministic with 272 transitions.
[2025-06-05 11:46:44] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:46:44] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:46:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9757451732032285167.gal : 2 ms
[2025-06-05 11:46:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17820526834169902455.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/CTLFireability9757451732032285167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17820526834169902455.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.30341e+28,15.5331,447576,2,4592,5,1.23016e+06,6,0,1462,3.29957e+06,0
Converting to forward existential form...Done !
original formula: EX(AF((((EF(EX((p256==1))) * A((p111==1) U ((p231==1)&&(p270==1)))) * ((p165==1) * EX((p84==1)))) * AG((((p272==1)&&(p295==1))&&(p323==1)...160
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((E(TRUE U EX((p256==1))) * !((E(!(((p231==1)&&(p270==1))) U (!((p111==1)) * !(((p231==1)&&...302
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...585
Detected timeout of ITS tools.
[2025-06-05 11:47:14] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:47:14] [INFO ] Applying decomposition
[2025-06-05 11:47:14] [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/graph13104839939176732273.txt' '-o' '/tmp/graph13104839939176732273.bin' '-w' '/tmp/graph13104839939176732273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13104839939176732273.bin' '-l' '-1' '-v' '-w' '/tmp/graph13104839939176732273.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:47:14] [INFO ] Decomposing Gal with order
[2025-06-05 11:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:47:14] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-05 11:47:14] [INFO ] Flatten gal took : 19 ms
[2025-06-05 11:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:47:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4770569088134136474.gal : 4 ms
[2025-06-05 11:47:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3775640709416718981.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/CTLFireability4770569088134136474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3775640709416718981.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.30341e+28,1.80224,53652,808,43,79653,546,621,274907,62,1444,0
Converting to forward existential form...Done !
original formula: EX(AF((((EF(EX((i13.i2.u80.p256==1))) * A((i5.u34.p111==1) U ((i13.i1.u73.p231==1)&&(i14.i1.u85.p270==1)))) * ((i11.i2.u52.p165==1) * EX(...252
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((E(TRUE U EX((i13.i2.u80.p256==1))) * !((E(!(((i13.i1.u73.p231==1)&&(i14.i1.u85.p270==1)))...438
Reverse transition relation is NOT exact ! Due to transitions t43, t83, t131, t176, t218, t220, i0.t209, i0.u12.t213, i1.i1.t216, i1.i1.u6.t223, i1.i1.u10....1132
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 298 transition count 273
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 298 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 297 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 297 transition count 272
Applied a total of 60 rules in 10 ms. Remains 297 /327 variables (removed 30) and now considering 272/302 (removed 30) transitions.
// Phase 1: matrix 272 rows 297 cols
[2025-06-05 11:47:44] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-05 11:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 11:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [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-06-05 11:47:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [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-06-05 11:47:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:49] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [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-06-05 11:47:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:51] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:51] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:53] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 272/569 variables, 297/378 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:59] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:47:59] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:02] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:07] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:11] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:11] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:11] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:14] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 390 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 44/90 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:15] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:15] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 272/569 variables, 297/389 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 271/660 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:18] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:19] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:21] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:21] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:21] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 20/680 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:21] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:22] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:22] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:23] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:23] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 16/696 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:27] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:27] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:28] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:28] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:33] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:33] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:33] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:48:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 5/705 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 708 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 297/327 places, 272/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60342 ms. Remains : 297/327 places, 272/302 transitions.
[2025-06-05 11:48:44] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:48:44] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:48:44] [INFO ] Input system was already deterministic with 272 transitions.
[2025-06-05 11:48:44] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:48:44] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:48:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8217255932594110344.gal : 1 ms
[2025-06-05 11:48:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11236136000572212866.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/CTLFireability8217255932594110344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11236136000572212866.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.78665e+28,19.0941,532088,2,5448,5,1.4465e+06,6,0,1462,3.94993e+06,0
Converting to forward existential form...Done !
original formula: EF((EX((!(E((p188==1) U (p78==1))) * !(A((p274==1) U (p289==1))))) * EX(((p295==1)&&(p323==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EX((!(E((p188==1) U (p78==1))) * !(!((E(!((p289==1)) U (!((p274==1)) * !((p289==1)))) + ...214
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t55, t57, t60,...590
Detected timeout of ITS tools.
[2025-06-05 11:49:14] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:49:14] [INFO ] Applying decomposition
[2025-06-05 11:49:14] [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/graph17725073724976876972.txt' '-o' '/tmp/graph17725073724976876972.bin' '-w' '/tmp/graph17725073724976876972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17725073724976876972.bin' '-l' '-1' '-v' '-w' '/tmp/graph17725073724976876972.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:49:14] [INFO ] Decomposing Gal with order
[2025-06-05 11:49:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:49:14] [INFO ] Removed a total of 52 redundant transitions.
[2025-06-05 11:49:14] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:49:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:49:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7376357949225882058.gal : 3 ms
[2025-06-05 11:49:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12498807287511354167.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/CTLFireability7376357949225882058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12498807287511354167.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.78665e+28,2.45249,72456,944,29,113107,339,601,393403,49,818,0
Converting to forward existential form...Done !
original formula: EF((EX((!(E((i11.i1.u60.p188==1) U (i5.i0.u24.p78==1))) * !(A((i15.i2.u86.p274==1) U (i19.i1.u90.p289==1))))) * EX(((i16.i0.u92.p295==1)&...178
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EX((!(E((i11.i1.u60.p188==1) U (i5.i0.u24.p78==1))) * !(!((E(!((i19.i1.u90.p289==1)) U (...299
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t132, t176, t218, t220, i0.i0.u2.t224, i0.i0.u9.t219, i0.i1.t192, i0.i1.u19.t196, i...1138
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 9 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
// Phase 1: matrix 274 rows 299 cols
[2025-06-05 11:49:44] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:49:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-05 11:49:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:49:45] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-05 11:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:48] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [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-06-05 11:49:49] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:50] [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-06-05 11:49:51] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [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-06-05 11:49:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 274/573 variables, 299/381 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:59] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:49:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:03] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:03] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:03] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:03] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:03] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:04] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:04] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:04] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/573 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 392 constraints, problems are : Problem set: 0 solved, 273 unsolved in 27048 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:13] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/573 variables, 299/385 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 273/658 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:16] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:16] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:16] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:16] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:17] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [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-06-05 11:50:18] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:18] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/678 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:19] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:19] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:20] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:20] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:20] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:20] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:21] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:22] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:22] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 12/690 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:25] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:25] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:26] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 9/699 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:29] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:31] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:31] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:32] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:32] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:50:32] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 713 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 57089ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 57089ms
Starting structural reductions in LTL mode, iteration 1 : 299/327 places, 274/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57369 ms. Remains : 299/327 places, 274/302 transitions.
[2025-06-05 11:50:42] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:50:42] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:50:42] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-05 11:50:42] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:50:42] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:50:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16625400110996188786.gal : 1 ms
[2025-06-05 11:50:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5974321263021451136.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/CTLFireability16625400110996188786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5974321263021451136.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4418e+28,18.5014,510948,2,5751,5,1.36104e+06,6,0,1472,3.80992e+06,0
Converting to forward existential form...Done !
original formula: AG(((AG((((p65==0) + A(((p292==1)&&(p346==1)) U ((p243==1)&&(p302==1)))) + EG((p331==1)))) + AF((((p314==0)||(p175==0))&&(((p91==0)||(p11...361
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((!((E(!(((!(EG(!(((p154==1)&&(p208==1))))) + EX((p349==1))) + (((p214==1)&&(p299==1)...731
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t22, t24, t27, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...603
Detected timeout of ITS tools.
[2025-06-05 11:51:12] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:51:12] [INFO ] Applying decomposition
[2025-06-05 11:51:12] [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/graph5203543130546174685.txt' '-o' '/tmp/graph5203543130546174685.bin' '-w' '/tmp/graph5203543130546174685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5203543130546174685.bin' '-l' '-1' '-v' '-w' '/tmp/graph5203543130546174685.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:51:12] [INFO ] Decomposing Gal with order
[2025-06-05 11:51:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:51:12] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-05 11:51:12] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:51:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:51:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1501988004204795800.gal : 2 ms
[2025-06-05 11:51:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14984062905291253731.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/CTLFireability1501988004204795800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14984062905291253731.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4418e+28,1.90982,61820,1174,30,107974,434,592,301807,52,1100,0
Converting to forward existential form...Done !
original formula: AG(((AG((((i1.i2.u19.p65==0) + A(((i17.i1.u94.p292==1)&&(i17.i3.u110.p346==1)) U ((i14.u78.p243==1)&&(i17.i1.u97.p302==1)))) + EG((i0.u10...583
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((!((E(!(((!(EG(!(((i11.i0.u50.p154==1)&&(i12.u67.p208==1))))) + EX((i17.i3.u111.p349...1113
Reverse transition relation is NOT exact ! Due to transitions t44, t84, t130, t178, t218, i0.t17, i0.u106.t22, i0.u107.t24, i1.i0.u2.t226, i1.i1.u11.t219, ...1157
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 326 transition count 244
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 269 transition count 242
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 268 transition count 239
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 265 transition count 239
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 123 place count 265 transition count 209
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 183 place count 235 transition count 209
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 204 place count 214 transition count 188
Iterating global reduction 4 with 21 rules applied. Total rules applied 225 place count 214 transition count 188
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 225 place count 214 transition count 174
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 253 place count 200 transition count 174
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 4 with 132 rules applied. Total rules applied 385 place count 134 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 387 place count 132 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 389 place count 130 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 389 place count 130 transition count 105
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 391 place count 129 transition count 105
Applied a total of 391 rules in 35 ms. Remains 129 /327 variables (removed 198) and now considering 105/302 (removed 197) transitions.
// Phase 1: matrix 105 rows 129 cols
[2025-06-05 11:51:42] [INFO ] Computed 44 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:42] [INFO ] Implicit Places using invariants in 58 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 128/327 places, 105/302 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 104
Applied a total of 2 rules in 5 ms. Remains 127 /128 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 127 cols
[2025-06-05 11:51:42] [INFO ] Computed 43 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:42] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 11:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:42] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 127/327 places, 104/302 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 248 ms. Remains : 127/327 places, 104/302 transitions.
[2025-06-05 11:51:42] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:51:42] [INFO ] Flatten gal took : 2 ms
[2025-06-05 11:51:42] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-05 11:51:42] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:51:42] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:51:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16492230423997757048.gal : 1 ms
[2025-06-05 11:51:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13413697369786268323.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/CTLFireability16492230423997757048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13413697369786268323.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.27232e+17,0.503757,25312,2,881,5,82681,6,0,611,148414,0
Converting to forward existential form...Done !
original formula: AF(((!(A(!(((p38==1)||(p264==1))) U (((p190==1)&&(p349==1))&&(p135!=1)))) * ((E(EF(((p88==1)&&(p116==1))) U (EG((p239==1)) + EG((p136==1)...242
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((((p190==1)&&(p349==1))&&(p135!=1))) U (!(!(((p38==1)||(p264==1)))) * !((((p190==1)&&(p3...398
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t7, t8, t9, t11, t12, t14, t15, t30, t33, t34, t36, t38, t40, t42, t44, t46, t50,...316
Detected timeout of ITS tools.
[2025-06-05 11:52:12] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:52:12] [INFO ] Applying decomposition
[2025-06-05 11:52:12] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17266335919581221112.txt' '-o' '/tmp/graph17266335919581221112.bin' '-w' '/tmp/graph17266335919581221112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17266335919581221112.bin' '-l' '-1' '-v' '-w' '/tmp/graph17266335919581221112.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:52:12] [INFO ] Decomposing Gal with order
[2025-06-05 11:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:52:12] [INFO ] Removed a total of 15 redundant transitions.
[2025-06-05 11:52:12] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:52:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:52:12] [INFO ] Time to serialize gal into /tmp/CTLFireability392560454992854881.gal : 1 ms
[2025-06-05 11:52:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2156669870082600198.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/CTLFireability392560454992854881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2156669870082600198.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 -...261
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.27232e+17,0.187687,12320,223,41,17402,240,315,37230,58,1112,0
Converting to forward existential form...Done !
original formula: AF(((!(A(!(((i2.u5.p38==1)||(i14.u34.p264==1))) U (((i9.u24.p190==1)&&(i15.u43.p349==1))&&(u17.p135!=1)))) * ((E(EF(((i6.u10.p88==1)&&(i6...339
=> equivalent forward existential formula: [FwdG(Init,!(((!(!((E(!((((i9.u24.p190==1)&&(i15.u43.p349==1))&&(u17.p135!=1))) U (!(!(((i2.u5.p38==1)||(i14.u34...533
Reverse transition relation is NOT exact ! Due to transitions t87, t90, t92, t95, u17.t12, u17.t42, u17.t83, u27.t9, i0.u2.t0, i0.u7.t60, i1.u6.t33, i1.u8....488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 302 transition count 277
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 302 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 301 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 301 transition count 276
Applied a total of 52 rules in 9 ms. Remains 301 /327 variables (removed 26) and now considering 276/302 (removed 26) transitions.
// Phase 1: matrix 276 rows 301 cols
[2025-06-05 11:52:42] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:52:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-05 11:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:52:43] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2025-06-05 11:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:46] [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-06-05 11:52:46] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:46] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:48] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:48] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:48] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [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-06-05 11:52:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:50] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 276/577 variables, 301/385 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:52:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:04] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:08] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:08] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:11] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 394 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 44/90 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/577 variables, 301/391 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 275/666 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:15] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:15] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:15] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:16] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:16] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:16] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:16] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:16] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:18] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:18] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:18] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:18] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 20/686 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:21] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:21] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:21] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 13/699 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:22] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:23] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:23] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:24] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:24] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:24] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:24] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 7/706 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:26] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:27] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:28] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:28] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:28] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 7/713 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:31] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:32] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:32] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 3/716 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:37] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:53:38] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 275 unsolved
SMT process timed out in 60040ms, After SMT, problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 301/327 places, 276/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60347 ms. Remains : 301/327 places, 276/302 transitions.
[2025-06-05 11:53:43] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:53:43] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:53:43] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-05 11:53:43] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:53:43] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:53:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10949919905773442547.gal : 2 ms
[2025-06-05 11:53:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14963921069735588355.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/CTLFireability10949919905773442547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14963921069735588355.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.08049e+28,29.5102,801908,2,6263,5,1.9882e+06,6,0,1482,6.08955e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-05 11:54:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:54:13] [INFO ] Applying decomposition
[2025-06-05 11:54:13] [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/graph9324933840736677291.txt' '-o' '/tmp/graph9324933840736677291.bin' '-w' '/tmp/graph9324933840736677291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9324933840736677291.bin' '-l' '-1' '-v' '-w' '/tmp/graph9324933840736677291.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:54:13] [INFO ] Decomposing Gal with order
[2025-06-05 11:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:54:13] [INFO ] Removed a total of 46 redundant transitions.
[2025-06-05 11:54:13] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:54:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13695939695292707091.gal : 3 ms
[2025-06-05 11:54:13] [INFO ] Time to serialize properties into /tmp/CTLFireability186710564624332301.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/CTLFireability13695939695292707091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability186710564624332301.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,8.08049e+28,6.01697,151676,1024,40,241530,586,636,897849,58,1738,0
Converting to forward existential form...Done !
original formula: A((!(((((i1.i0.u7.p18==1)&&(i7.u18.p51==1))||(i8.i0.u69.p217==1)) * (((i15.i2.u70.p219==1) * AG(((i4.i0.u29.p88==1)&&(i4.i1.u37.p116==1))...491
=> equivalent forward existential formula: [((Init * !(EG(!((((i8.i0.u69.p216==1) + E((!(EG(!((i9.u56.p176==1)))) * !((E(!((i11.i2.u60.p183==1)) U (!((i10....1568
Reverse transition relation is NOT exact ! Due to transitions t43, t130, t179, t222, i0.i1.u2.t228, i0.i1.u10.t223, i0.i2.t196, i0.i2.u20.t200, i1.t224, i1...1249
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 303 transition count 278
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 303 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 302 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 302 transition count 277
Applied a total of 50 rules in 8 ms. Remains 302 /327 variables (removed 25) and now considering 277/302 (removed 25) transitions.
// Phase 1: matrix 277 rows 302 cols
[2025-06-05 11:54:43] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:54:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-05 11:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:54:43] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 11:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [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-06-05 11:54:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:48] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:49] [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-06-05 11:54:49] [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-06-05 11:54:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:49] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:50] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:53] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 277/579 variables, 302/385 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:59] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:54:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:01] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:09] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:12] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:13] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/579 variables, and 395 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 45/91 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/579 variables, 302/393 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 276/669 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:16] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:17] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:19] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:19] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:20] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:20] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:20] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:21] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:21] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:21] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:22] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:22] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 17/706 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:25] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:25] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:26] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:26] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:26] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 6/712 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:29] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:31] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:38] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:55:43] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/579 variables, and 717 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60038ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in LTL mode, iteration 1 : 302/327 places, 277/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60326 ms. Remains : 302/327 places, 277/302 transitions.
[2025-06-05 11:55:43] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:55:43] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:55:43] [INFO ] Input system was already deterministic with 277 transitions.
[2025-06-05 11:55:43] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:55:43] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:55:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16281633011721093847.gal : 1 ms
[2025-06-05 11:55:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12121017960968623870.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/CTLFireability16281633011721093847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12121017960968623870.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.27093e+28,18.7031,521540,2,4990,5,1.38661e+06,6,0,1487,3.89133e+06,0
Converting to forward existential form...Done !
original formula: A(((AG(((!((p276==1)&&(p283==1)))&&(p55==1))) + AX(((((p72==1)&&(p122==1)) + AG((p55==1))) * (((p85==1)&&(p139==1))||((p141==1)&&(p340==1...286
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(EG(!(((p218==1)&&(p134==1)))))) + !(E(TRUE U !((p76!=1))))) + (E(TRUE U !((((p115==1)&&(p...699
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t18, t23, t27, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t52, t56, t58, t62,...609
Detected timeout of ITS tools.
[2025-06-05 11:56:13] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:56:13] [INFO ] Applying decomposition
[2025-06-05 11:56:13] [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/graph15720904403685683666.txt' '-o' '/tmp/graph15720904403685683666.bin' '-w' '/tmp/graph15720904403685683666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15720904403685683666.bin' '-l' '-1' '-v' '-w' '/tmp/graph15720904403685683666.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:56:13] [INFO ] Decomposing Gal with order
[2025-06-05 11:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:56:13] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-05 11:56:13] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13040462831110011306.gal : 3 ms
[2025-06-05 11:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13937787711020160812.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/CTLFireability13040462831110011306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13937787711020160812.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.27093e+28,2.26844,75072,808,30,122883,383,640,411062,52,989,0
Converting to forward existential form...Done !
original formula: A(((AG(((!((i14.i2.u89.p276==1)&&(i14.i2.u92.p283==1)))&&(i0.u21.p55==1))) + AX(((((i3.i3.u23.p72==1)&&(i5.i1.u37.p122==1)) + AG((i0.u21....451
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(EG(!(((i14.i0.u70.p218==1)&&(i6.u41.p134==1)))))) + !(E(TRUE U !((i3.i3.u24.p76!=1))))) +...986
Reverse transition relation is NOT exact ! Due to transitions t44, t90, t130, t179, t225, i0.t196, i0.u20.t201, i0.u21.t203, i1.t214, i1.u12.t218, i2.i0.u8...1181
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 299 transition count 274
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 299 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 298 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 298 transition count 273
Applied a total of 58 rules in 8 ms. Remains 298 /327 variables (removed 29) and now considering 273/302 (removed 29) transitions.
// Phase 1: matrix 273 rows 298 cols
[2025-06-05 11:56:44] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 11:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:44] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-05 11:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [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-06-05 11:56:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56: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-06-05 11:56:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:50] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 273/571 variables, 298/380 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:56:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:01] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:01] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:09] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:10] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:14] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 389 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:14] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:17] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 273/571 variables, 298/389 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 272/661 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:19] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:19] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:19] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:19] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:21] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:21] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:22] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:22] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:22] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/681 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:23] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:23] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:24] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 13/694 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:27] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:27] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:28] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:28] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 5/699 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:30] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:30] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:31] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:31] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:31] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 5/704 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:41] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:57:42] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 272 unsolved
SMT process timed out in 60049ms, After SMT, problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 298/327 places, 273/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60306 ms. Remains : 298/327 places, 273/302 transitions.
[2025-06-05 11:57:44] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:57:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:57:44] [INFO ] Input system was already deterministic with 273 transitions.
[2025-06-05 11:57:44] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:57:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:57:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7955645023943143140.gal : 1 ms
[2025-06-05 11:57:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3192452610699236122.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/CTLFireability7955645023943143140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3192452610699236122.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.77048e+28,17.5226,479164,2,4624,5,1.29488e+06,6,0,1467,3.54932e+06,0
Converting to forward existential form...Done !
original formula: AX((AX(((p149==1)&&(p342==1))) + ((A(!(AG((p227==1))) U (p133==1)) * (((EX((p320==0)) + AF(((p85==0)||(p139==0)))) + ((p347==1)||((p174==...258
=> equivalent forward existential formula: ((([((FwdU((EY(Init) * !(!(EX(!(((p149==1)&&(p342==1))))))),!((p133==1))) * !((p133==1))) * !(E(TRUE U !((p227==...572
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t34, t36, t37, t39, t40, t41, t42, t43, t44, t46, t47, t51, t55,...595
Detected timeout of ITS tools.
[2025-06-05 11:58:14] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:58:14] [INFO ] Applying decomposition
[2025-06-05 11:58:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5119291132109061736.txt' '-o' '/tmp/graph5119291132109061736.bin' '-w' '/tmp/graph5119291132109061736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5119291132109061736.bin' '-l' '-1' '-v' '-w' '/tmp/graph5119291132109061736.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:58:14] [INFO ] Decomposing Gal with order
[2025-06-05 11:58:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:58:14] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-05 11:58:14] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:58:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 11:58:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17885463297511994352.gal : 2 ms
[2025-06-05 11:58:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5021630768407822594.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/CTLFireability17885463297511994352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5021630768407822594.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.77048e+28,1.70206,56440,746,29,86420,332,583,294728,49,967,0
Converting to forward existential form...Done !
original formula: AX((AX(((i11.i0.u48.p149==1)&&(i17.i2.u107.p342==1))) + ((A(!(AG((i13.i0.u72.p227==1))) U (i7.u43.p133==1)) * (((EX((i19.i1.u103.p320==0)...419
=> equivalent forward existential formula: ((([((FwdU((EY(Init) * !(!(EX(!(((i11.i0.u48.p149==1)&&(i17.i2.u107.p342==1))))))),!((i7.u43.p133==1))) * !((i7....816
Reverse transition relation is NOT exact ! Due to transitions t44, t88, t132, t177, t219, t221, i0.t104, i0.u62.t108, i1.t210, i1.u12.t214, i2.i0.u7.t223, ...1154
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 297 transition count 272
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 297 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 296 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 296 transition count 271
Applied a total of 62 rules in 15 ms. Remains 296 /327 variables (removed 31) and now considering 271/302 (removed 31) transitions.
// Phase 1: matrix 271 rows 296 cols
[2025-06-05 11:58:44] [INFO ] Computed 46 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:58:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-05 11:58:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:58:44] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 11:58:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [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-06-05 11:58:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:49] [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-06-05 11:58:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:50] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [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-06-05 11:58:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 271/567 variables, 296/376 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:58:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:05] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:06] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:06] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:06] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:07] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:07] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 386 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 38/84 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:15] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:15] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 271/567 variables, 296/382 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 270/652 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:18] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:18] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:18] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:18] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:18] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:19] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:20] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:22] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:22] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:22] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:22] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [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-06-05 11:59:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:24] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:24] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 17/689 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:26] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:26] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 3/692 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:30] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:33] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:59:39] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 270 unsolved
SMT process timed out in 60041ms, After SMT, problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 296/327 places, 271/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60319 ms. Remains : 296/327 places, 271/302 transitions.
[2025-06-05 11:59:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:59:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:59:44] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-05 11:59:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:59:44] [INFO ] Flatten gal took : 5 ms
[2025-06-05 11:59:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14049090384610483522.gal : 1 ms
[2025-06-05 11:59:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5060737966993806614.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/CTLFireability14049090384610483522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5060737966993806614.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.22773e+28,15.282,445588,2,4569,5,1.22651e+06,6,0,1457,3.27287e+06,0
Converting to forward existential form...Done !
original formula: E(EF((!(((!(AX((p296==1))) + (p90==1)) + ((p305==1)||(p117==1)))) * EX((A((p251==1) U ((p299==1)&&(p301==1))) + AX((p218==1)))))) U (AG((...182
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U (!(((!(!(EX(!((p296==1))))) + (p90==1)) + ((p305==1)||(p117==1)))) * EX((!((E(!(((p299==1)...582
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...585
Detected timeout of ITS tools.
[2025-06-05 12:00:14] [INFO ] Flatten gal took : 7 ms
[2025-06-05 12:00:14] [INFO ] Applying decomposition
[2025-06-05 12:00:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10133008453516930380.txt' '-o' '/tmp/graph10133008453516930380.bin' '-w' '/tmp/graph10133008453516930380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10133008453516930380.bin' '-l' '-1' '-v' '-w' '/tmp/graph10133008453516930380.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:00:14] [INFO ] Decomposing Gal with order
[2025-06-05 12:00:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:00:14] [INFO ] Removed a total of 53 redundant transitions.
[2025-06-05 12:00:14] [INFO ] Flatten gal took : 10 ms
[2025-06-05 12:00:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:00:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2508209018005315769.gal : 2 ms
[2025-06-05 12:00:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8856376990842314671.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/CTLFireability2508209018005315769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8856376990842314671.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.22773e+28,2.25589,69516,737,29,101673,308,609,409022,47,751,0
Converting to forward existential form...Done !
original formula: E(EF((!(((!(AX((i17.i0.u95.p296==1))) + (i6.i0.u31.p90==1)) + ((i19.i1.u98.p305==1)||(i6.i1.u37.p117==1)))) * EX((A((i13.i2.u80.p251==1) ...288
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U (!(((!(!(EX(!((i17.i0.u95.p296==1))))) + (i6.i0.u31.p90==1)) + ((i19.i1.u98.p305==1)||(i6....862
Reverse transition relation is NOT exact ! Due to transitions t43, t83, t131, t175, t219, i0.t120, i0.u55.t124, i1.t215, i1.i0.u2.t223, i1.i1.u11.t216, i1....1124
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 298 transition count 273
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 298 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 297 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 297 transition count 272
Applied a total of 60 rules in 9 ms. Remains 297 /327 variables (removed 30) and now considering 272/302 (removed 30) transitions.
// Phase 1: matrix 272 rows 297 cols
[2025-06-05 12:00:45] [INFO ] Computed 46 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:00:45] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-05 12:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:00:45] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 12:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:48] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:48] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:48] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [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-06-05 12:00:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [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-06-05 12:00:49] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:49] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:50] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 272/569 variables, 297/377 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:57] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:57] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:00:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:05] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/569 variables, and 385 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/569 variables, 297/385 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 271/656 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:19] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:19] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:20] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:20] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:20] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:20] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:21] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 20/676 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:23] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:23] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:23] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:24] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:24] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:24] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:24] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:25] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:25] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:25] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 11/687 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:27] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:27] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:28] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:28] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:29] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 7/694 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:31] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:31] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:31] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:32] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:33] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:34] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:34] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 8/702 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:37] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:39] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:40] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:01:43] [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-06-05 12:01:43] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 707 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 297/327 places, 272/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60327 ms. Remains : 297/327 places, 272/302 transitions.
[2025-06-05 12:01:45] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:01:45] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:01:45] [INFO ] Input system was already deterministic with 272 transitions.
[2025-06-05 12:01:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:01:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:01:45] [INFO ] Time to serialize gal into /tmp/CTLFireability188859680164724192.gal : 2 ms
[2025-06-05 12:01:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3036771590623482101.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/CTLFireability188859680164724192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3036771590623482101.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.
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.80156e+28,17.1871,461788,2,4742,5,1.23313e+06,6,0,1462,3.41496e+06,0
Converting to forward existential form...Done !
original formula: (EX(AG(((p129==0)||(p344==0)))) * EF(AX((EX(AG(((p294==1)&&(p327==1)))) * (p15==0)))))
=> equivalent forward existential formula: [(FwdU((Init * EX(!(E(TRUE U !(((p129==0)||(p344==0))))))),TRUE) * !(EX(!((EX(!(E(TRUE U !(((p294==1)&&(p327==1)...186
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t14, t18, t22, t27, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...590
Detected timeout of ITS tools.
[2025-06-05 12:02:15] [INFO ] Flatten gal took : 9 ms
[2025-06-05 12:02:15] [INFO ] Applying decomposition
[2025-06-05 12:02:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3895283646498958635.txt' '-o' '/tmp/graph3895283646498958635.bin' '-w' '/tmp/graph3895283646498958635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3895283646498958635.bin' '-l' '-1' '-v' '-w' '/tmp/graph3895283646498958635.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:02:15] [INFO ] Decomposing Gal with order
[2025-06-05 12:02:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:02:15] [INFO ] Removed a total of 52 redundant transitions.
[2025-06-05 12:02:15] [INFO ] Flatten gal took : 10 ms
[2025-06-05 12:02:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:02:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15453185906459854471.gal : 3 ms
[2025-06-05 12:02:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9659734741999818191.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/CTLFireability15453185906459854471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9659734741999818191.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.80156e+28,2.1,66560,725,29,103456,294,609,382060,47,719,0
Converting to forward existential form...Done !
original formula: (EX(AG(((i4.u41.p129==0)||(i19.i1.u111.p344==0)))) * EF(AX((EX(AG(((i19.i0.u93.p294==1)&&(i16.u102.p327==1)))) * (i1.i1.u6.p15==0)))))
=> equivalent forward existential formula: [(FwdU((Init * EX(!(E(TRUE U !(((i4.u41.p129==0)||(i19.i1.u111.p344==0))))))),TRUE) * !(EX(!((EX(!(E(TRUE U !(((...234
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t88, t128, t176, t220, i0.i0.u8.t222, i0.i1.t201, i0.i1.t205, i1.t218, i1.i1.t216, ...1138
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 299 transition count 274
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 14 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
// Phase 1: matrix 274 rows 299 cols
[2025-06-05 12:02:45] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:02:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-05 12:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:02:45] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-05 12:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:49] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:51] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02: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-06-05 12:02:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02: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-06-05 12:02:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:55] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:02:55] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 274/573 variables, 299/381 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:03] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:04] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:06] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:06] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:09] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:13] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:13] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 391 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 41/87 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/573 variables, 299/386 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 273/659 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:18] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:18] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:18] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:19] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:20] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:20] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:20] [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-06-05 12:03:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:21] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:21] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 20/679 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:21] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:21] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:22] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:22] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:22] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:22] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:22] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:23] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:23] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:24] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:25] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:25] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:26] [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-06-05 12:03:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:27] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:28] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 7/706 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:32] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:33] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:34] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:35] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:35] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 6/712 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:41] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:03:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 273 unsolved
SMT process timed out in 60034ms, After SMT, problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60035ms
Starting structural reductions in LTL mode, iteration 1 : 299/327 places, 274/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 299/327 places, 274/302 transitions.
[2025-06-05 12:03:45] [INFO ] Flatten gal took : 8 ms
[2025-06-05 12:03:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:03:45] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-05 12:03:45] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:03:45] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:03:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4602957585353367316.gal : 1 ms
[2025-06-05 12:03:45] [INFO ] Time to serialize properties into /tmp/CTLFireability12585824724930434265.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/CTLFireability4602957585353367316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12585824724930434265.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.77986e+28,20.9733,578520,2,5507,5,1.53167e+06,6,0,1472,4.33402e+06,0
Converting to forward existential form...Done !
original formula: EX((A(AG(!(E((p313==1) U (p187==1)))) U ((p218==1)||(p15==1))) + ((EX(((A((p57==1) U ((p167==1)&&(p265==1))) * (p205==0)) * (p1==0))) * E...226
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(((p218==1)||(p15==1)))))) * !(E(!(((p218==1)||(p15==1))) U (!(!(E(TRUE U !(!(E((p313==1) U...826
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t33, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60,...609
Detected timeout of ITS tools.
[2025-06-05 12:04:16] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:04:16] [INFO ] Applying decomposition
[2025-06-05 12:04:16] [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/graph9041986817716761765.txt' '-o' '/tmp/graph9041986817716761765.bin' '-w' '/tmp/graph9041986817716761765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9041986817716761765.bin' '-l' '-1' '-v' '-w' '/tmp/graph9041986817716761765.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:04:16] [INFO ] Decomposing Gal with order
[2025-06-05 12:04:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:04:16] [INFO ] Removed a total of 49 redundant transitions.
[2025-06-05 12:04:16] [INFO ] Flatten gal took : 11 ms
[2025-06-05 12:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:04:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16422821033132963720.gal : 3 ms
[2025-06-05 12:04:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3597156703887237605.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/CTLFireability16422821033132963720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3597156703887237605.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.77986e+28,2.4777,76796,826,40,135520,587,617,345442,58,1474,0
Converting to forward existential form...Done !
original formula: EX((A(AG(!(E((i17.u101.p313==1) U (i10.i1.u60.p187==1)))) U ((i16.i0.u70.p218==1)||(i2.i1.u5.p15==1))) + ((EX(((A((i0.u22.p57==1) U ((i11...361
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(((i16.i0.u70.p218==1)||(i2.i1.u5.p15==1)))))) * !(E(!(((i16.i0.u70.p218==1)||(i2.i1.u5.p15...1229
Reverse transition relation is NOT exact ! Due to transitions t44, t88, t133, t173, t220, i0.t199, i0.t193, i0.u20.t198, i0.u22.t197, i1.i1.u2.t226, i1.i1....1173
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 326 transition count 238
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 263 transition count 236
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 262 transition count 233
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 135 place count 259 transition count 233
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 135 place count 259 transition count 206
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 189 place count 232 transition count 206
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 212 place count 209 transition count 183
Iterating global reduction 4 with 23 rules applied. Total rules applied 235 place count 209 transition count 183
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 235 place count 209 transition count 167
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 267 place count 193 transition count 167
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 415 place count 119 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 117 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 419 place count 115 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 419 place count 115 transition count 90
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 421 place count 114 transition count 90
Applied a total of 421 rules in 32 ms. Remains 114 /327 variables (removed 213) and now considering 90/302 (removed 212) transitions.
// Phase 1: matrix 90 rows 114 cols
[2025-06-05 12:04:46] [INFO ] Computed 44 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:04:46] [INFO ] Implicit Places using invariants in 70 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/327 places, 90/302 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 89
Applied a total of 2 rules in 3 ms. Remains 112 /113 variables (removed 1) and now considering 89/90 (removed 1) transitions.
// Phase 1: matrix 89 rows 112 cols
[2025-06-05 12:04:46] [INFO ] Computed 43 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:04:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 12:04:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:04:46] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 112/327 places, 89/302 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 238 ms. Remains : 112/327 places, 89/302 transitions.
[2025-06-05 12:04:46] [INFO ] Flatten gal took : 2 ms
[2025-06-05 12:04:46] [INFO ] Flatten gal took : 2 ms
[2025-06-05 12:04:46] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-05 12:04:46] [INFO ] Flatten gal took : 2 ms
[2025-06-05 12:04:46] [INFO ] Flatten gal took : 2 ms
[2025-06-05 12:04:46] [INFO ] Time to serialize gal into /tmp/CTLFireability257421451955042405.gal : 0 ms
[2025-06-05 12:04:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16284576190578830179.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/CTLFireability257421451955042405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16284576190578830179.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.617e+16,0.182212,12108,2,382,5,34737,6,0,539,54974,0
Converting to forward existential form...Done !
original formula: AG(AF(!(E((p348==1) U (p43==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E((p348==1) U (p43==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t16, t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,0,0.506581,24212,1,0,177,98900,204,80,3229,151548,200
FORMULA ShieldIIPt-PT-005B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 16 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
// Phase 1: matrix 274 rows 299 cols
[2025-06-05 12:04:46] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:04:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-05 12:04:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:04:47] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-05 12:04:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:51] [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-06-05 12:04:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [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-06-05 12:04:53] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [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-06-05 12:04:53] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/573 variables, 299/380 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:04:59] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:03] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:03] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:03] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:06] [INFO ] Deduced a trap along path composed of 4 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:10] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:11] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 391 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:18] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/573 variables, 299/388 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 273/661 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:22] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:23] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 20/681 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:24] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:24] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:25] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:25] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [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-06-05 12:05:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:26] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:27] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:27] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 13/694 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:30] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:30] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:31] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:31] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 5/699 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:35] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:37] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:42] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:05:42] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 60046ms, After SMT, problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 299/327 places, 274/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60326 ms. Remains : 299/327 places, 274/302 transitions.
[2025-06-05 12:05:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:05:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:05:47] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-05 12:05:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:05:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16584564763788530105.gal : 1 ms
[2025-06-05 12:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2694702701332862883.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/CTLFireability16584564763788530105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2694702701332862883.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31218e+28,19.6241,536336,2,5028,5,1.41355e+06,6,0,1472,4.0034e+06,0
Converting to forward existential form...Done !
original formula: E(EX(AG(!((((p123!=1)&&(p74==1))&&(p322==1))))) U ((p150==1) * AX((AX(((p275==1)||(p182==1))) + (p245==1)))))
=> equivalent forward existential formula: [((FwdU(Init,EX(!(E(TRUE U !(!((((p123!=1)&&(p74==1))&&(p322==1)))))))) * (p150==1)) * !(EX(!((!(EX(!(((p275==1)...197
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t57,...602
Detected timeout of ITS tools.
[2025-06-05 12:06:17] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:06:17] [INFO ] Applying decomposition
[2025-06-05 12:06:17] [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/graph14318687065002136961.txt' '-o' '/tmp/graph14318687065002136961.bin' '-w' '/tmp/graph14318687065002136961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14318687065002136961.bin' '-l' '-1' '-v' '-w' '/tmp/graph14318687065002136961.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:06:17] [INFO ] Decomposing Gal with order
[2025-06-05 12:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:06:17] [INFO ] Removed a total of 46 redundant transitions.
[2025-06-05 12:06:17] [INFO ] Flatten gal took : 10 ms
[2025-06-05 12:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:06:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5109586030046665521.gal : 3 ms
[2025-06-05 12:06:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3651421918358473530.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/CTLFireability5109586030046665521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3651421918358473530.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.31218e+28,1.92116,63112,689,29,102667,449,601,330234,49,1134,0
Converting to forward existential form...Done !
original formula: E(EX(AG(!((((i6.u40.p123!=1)&&(i4.u23.p74==1))&&(i18.u104.p322==1))))) U ((i12.i0.u48.p150==1) * AX((AX(((i14.i2.u89.p275==1)||(i11.i2.u5...191
=> equivalent forward existential formula: [((FwdU(Init,EX(!(E(TRUE U !(!((((i6.u40.p123!=1)&&(i4.u23.p74==1))&&(i18.u104.p322==1)))))))) * (i12.i0.u48.p15...261
Reverse transition relation is NOT exact ! Due to transitions t44, t89, t129, t177, t218, i0.i0.u29.t179, i0.i1.t158, i0.i1.t162, i1.t222, i1.i0.u8.t224, i...1181
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Applied a total of 54 rules in 11 ms. Remains 300 /327 variables (removed 27) and now considering 275/302 (removed 27) transitions.
// Phase 1: matrix 275 rows 300 cols
[2025-06-05 12:06:47] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:06:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 12:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:06:47] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-05 12:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [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-06-05 12:06:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:51] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [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-06-05 12:06:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:53] [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-06-05 12:06:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [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-06-05 12:06:54] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:06:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 275/575 variables, 300/382 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:07] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:14] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:15] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:15] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/575 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/575 variables, and 391 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 45/91 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/575 variables, 300/391 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/575 variables, 274/665 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:22] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:22] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:22] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:23] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:24] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:25] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:25] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:25] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:25] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:26] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:26] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:26] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:26] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:27] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:27] [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-06-05 12:07:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:27] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:27] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:27] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:28] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:28] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 18/703 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:31] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:31] [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-06-05 12:07:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 5/708 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:35] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:36] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:07:39] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 712 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60034ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60034ms
Starting structural reductions in LTL mode, iteration 1 : 300/327 places, 275/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60309 ms. Remains : 300/327 places, 275/302 transitions.
[2025-06-05 12:07:47] [INFO ] Flatten gal took : 7 ms
[2025-06-05 12:07:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:07:47] [INFO ] Input system was already deterministic with 275 transitions.
[2025-06-05 12:07:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:07:47] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:07:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16003099939420170445.gal : 1 ms
[2025-06-05 12:07:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14404187335605437671.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/CTLFireability16003099939420170445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14404187335605437671.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.32599e+28,17.1862,467596,2,4735,5,1.27936e+06,6,0,1477,3.43776e+06,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AG((p271==0)) + (p108==0)) + ((p176==0)||(p159==0))) + (p40==0))) * (p312==0)) * AF((((p160==1)&&(p179==1))&&(p118==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(E(TRUE U !((p271==0)))) + (p108==0)) + ((p176==0)||(p159==0))) + (p40==0))))) * (p312...220
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t17, t21, t26, t30, t34, t38, t41, t42, t43, t44, t45, t47, t48, t52, t56, t62, t67,...598
Detected timeout of ITS tools.
[2025-06-05 12:08:17] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:08:17] [INFO ] Applying decomposition
[2025-06-05 12:08:17] [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/graph5170917555189425023.txt' '-o' '/tmp/graph5170917555189425023.bin' '-w' '/tmp/graph5170917555189425023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5170917555189425023.bin' '-l' '-1' '-v' '-w' '/tmp/graph5170917555189425023.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:08:17] [INFO ] Decomposing Gal with order
[2025-06-05 12:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:08:17] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-05 12:08:17] [INFO ] Flatten gal took : 9 ms
[2025-06-05 12:08:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:08:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8424114094752079920.gal : 2 ms
[2025-06-05 12:08:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3277104004917408081.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/CTLFireability8424114094752079920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3277104004917408081.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.32599e+28,1.71448,58908,706,39,91049,583,610,327047,59,1426,0
Converting to forward existential form...Done !
original formula: AF(((AX((((AG((i15.u88.p271==0)) + (i4.u36.p108==0)) + ((i8.u57.p176==0)||(i10.i0.u53.p159==0))) + (i1.u14.p40==0))) * (i19.u102.p312==0)...228
=> equivalent forward existential formula: [FwdG(Init,!(((!(EX(!((((!(E(TRUE U !((i15.u88.p271==0)))) + (i4.u36.p108==0)) + ((i8.u57.p176==0)||(i10.i0.u53....297
Reverse transition relation is NOT exact ! Due to transitions t41, t90, t130, t178, t223, i0.i0.u8.t225, i0.i1.t203, i0.i1.t207, i1.t211, i1.u13.t216, i1.u...1146
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 299 transition count 274
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 299 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 298 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 298 transition count 273
Applied a total of 58 rules in 10 ms. Remains 298 /327 variables (removed 29) and now considering 273/302 (removed 29) transitions.
// Phase 1: matrix 273 rows 298 cols
[2025-06-05 12:08:47] [INFO ] Computed 46 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:08:47] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-05 12:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 12:08:48] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-05 12:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:52] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:53] [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-06-05 12:08:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:53] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:53] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [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-06-05 12:08:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:08:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 273/571 variables, 298/379 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:03] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:06] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:06] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:07] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:10] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:10] [INFO ] Deduced a trap along path composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 386 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:18] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 273/571 variables, 298/380 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 272/652 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:21] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:22] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:24] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:24] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:24] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:24] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 20/672 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:24] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:25] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:25] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:25] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:25] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:26] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:26] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:26] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:26] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:26] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:28] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/692 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:28] [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-06-05 12:09:28] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:30] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:30] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:31] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 5/697 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:35] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:36] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:36] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:37] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:37] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 12:09:37] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 6/703 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 7/710 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 710 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 298/327 places, 273/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60318 ms. Remains : 298/327 places, 273/302 transitions.
[2025-06-05 12:09:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:09:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:09:48] [INFO ] Input system was already deterministic with 273 transitions.
[2025-06-05 12:09:48] [INFO ] Flatten gal took : 4 ms
[2025-06-05 12:09:48] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:09:48] [INFO ] Time to serialize gal into /tmp/CTLFireability18099421706977469785.gal : 1 ms
[2025-06-05 12:09:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16874809847218031576.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/CTLFireability18099421706977469785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16874809847218031576.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.80598e+28,18.2321,497920,2,4743,5,1.34773e+06,6,0,1467,3.67579e+06,0
Converting to forward existential form...Done !
original formula: AG(AX((E(AX((p268==1)) U (p67!=1)) + (p352==1))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !((p352==1))) * !(E(!(EX(!((p268==1)))) U (p67!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t18, t22, t27, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55, t60, t64,...591
(forward)formula 0,0,20.7309,497920,1,0,581,1.34773e+06,569,283,8123,3.67579e+06,562
FORMULA ShieldIIPt-PT-005B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-05 12:10:09] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:10:09] [INFO ] Flatten gal took : 5 ms
[2025-06-05 12:10:09] [INFO ] Applying decomposition
[2025-06-05 12:10:09] [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/graph8495369924769835767.txt' '-o' '/tmp/graph8495369924769835767.bin' '-w' '/tmp/graph8495369924769835767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8495369924769835767.bin' '-l' '-1' '-v' '-w' '/tmp/graph8495369924769835767.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:10:09] [INFO ] Decomposing Gal with order
[2025-06-05 12:10:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:10:09] [INFO ] Removed a total of 32 redundant transitions.
[2025-06-05 12:10:09] [INFO ] Flatten gal took : 12 ms
[2025-06-05 12:10:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:10:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9565997029108369879.gal : 3 ms
[2025-06-05 12:10:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14242904509074933201.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/CTLFireability9565997029108369879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14242904509074933201.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 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.27415e+29,9.28521,194348,1992,36,281883,479,680,1.05197e+06,58,1497,0
Converting to forward existential form...Done !
original formula: EF(((E(!(A(AG(((i5.i1.u32.p87==1)&&(i6.i1.u44.p120==1))) U EX(((i6.i0.u34.p93==1)&&(i0.u47.p132==1))))) U A(AX((i9.i2.u73.p212==1)) U !(E...503
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (E(!(!((E(!(EX(((i6.i0.u34.p93==1)&&(i0.u47.p132==1)))) U (!(!(E(TRUE U !(((i5.i1.u32.p87...1482
Reverse transition relation is NOT exact ! Due to transitions t51, t97, t151, t200, t248, i0.t175, i0.u47.t170, i0.u48.t174, i1.t250, i1.i1.t246, i1.i1.u6....1670
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2025-06-05 12:39:52] [INFO ] Applying decomposition
[2025-06-05 12:39:52] [INFO ] Flatten gal took : 6 ms
[2025-06-05 12:39:52] [INFO ] Decomposing Gal with order
[2025-06-05 12:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:39:52] [INFO ] Removed a total of 6 redundant transitions.
[2025-06-05 12:39:52] [INFO ] Flatten gal took : 10 ms
[2025-06-05 12:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-05 12:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12571367225989676557.gal : 2 ms
[2025-06-05 12:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1943547140129929438.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/CTLFireability12571367225989676557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1943547140129929438.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 13 CTL formulae.
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="ShieldIIPt-PT-005B"
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 ShieldIIPt-PT-005B, 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 r198-tall-174894532800498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005B.tgz
mv ShieldIIPt-PT-005B 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 ;