About the Execution of ITS-Tools for ShieldPPPt-PT-030B
| 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?????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600898.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 ShieldPPPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600898
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 569K May 29 14:33 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 ShieldPPPt-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2023-15
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1749314024780
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 16:33:45] [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-07 16:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 16:33:46] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-06-07 16:33:46] [INFO ] Transformed 2343 places.
[2025-06-07 16:33:46] [INFO ] Transformed 2133 transitions.
[2025-06-07 16:33:46] [INFO ] Found NUPN structural information;
[2025-06-07 16:33:46] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 159 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 2041 transition count 1831
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 2041 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 605 place count 2040 transition count 1830
Iterating global reduction 0 with 1 rules applied. Total rules applied 606 place count 2040 transition count 1830
Applied a total of 606 rules in 756 ms. Remains 2040 /2343 variables (removed 303) and now considering 1830/2133 (removed 303) transitions.
// Phase 1: matrix 1830 rows 2040 cols
[2025-06-07 16:33:47] [INFO ] Computed 331 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:33:48] [INFO ] Implicit Places using invariants in 821 ms returned []
[2025-06-07 16:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:33:49] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
Running 1829 sub problems to find dead transitions.
[2025-06-07 16:33:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2039/3870 variables, and 0 constraints, problems are : Problem set: 0 solved, 1829 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2040 constraints, PredecessorRefiner: 1829/1829 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1829 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2039/3870 variables, and 0 constraints, problems are : Problem set: 0 solved, 1829 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2040 constraints, PredecessorRefiner: 0/1829 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1829 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 2040/2343 places, 1830/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63677 ms. Remains : 2040/2343 places, 1830/2133 transitions.
Support contains 159 out of 2040 places after structural reductions.
[2025-06-07 16:34:50] [INFO ] Flatten gal took : 127 ms
[2025-06-07 16:34:50] [INFO ] Flatten gal took : 74 ms
[2025-06-07 16:34:50] [INFO ] Input system was already deterministic with 1830 transitions.
RANDOM walk for 40000 steps (8 resets) in 1785 ms. (22 steps per ms) remains 52/103 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
[2025-06-07 16:34:51] [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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 605/680 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1360/2040 variables, 251/331 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2040 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1830/3870 variables, 2040/2371 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3870/3870 variables, and 2371 constraints, problems are : Problem set: 0 solved, 52 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2040/2040 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 605/680 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:57] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1360/2040 variables, 251/333 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:59] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:59] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:59] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:59] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:34:59] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:00] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:01] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:01] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:01] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:01] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:01] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 10 ms to minimize.
SMT process timed out in 10068ms, After SMT, problems are : Problem set: 0 solved, 52 unsolved
Fused 52 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 75 out of 2040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 383 transitions
Trivial Post-agglo rules discarded 383 transitions
Performed 383 trivial Post agglomeration. Transition count delta: 383
Iterating post reduction 0 with 383 rules applied. Total rules applied 383 place count 2040 transition count 1447
Reduce places removed 383 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 395 rules applied. Total rules applied 778 place count 1657 transition count 1435
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 790 place count 1645 transition count 1435
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 790 place count 1645 transition count 1220
Deduced a syphon composed of 215 places in 3 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 1220 place count 1430 transition count 1220
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1230 place count 1420 transition count 1210
Iterating global reduction 3 with 10 rules applied. Total rules applied 1240 place count 1420 transition count 1210
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1240 place count 1420 transition count 1203
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1254 place count 1413 transition count 1203
Performed 501 Post agglomeration using F-continuation condition.Transition count delta: 501
Deduced a syphon composed of 501 places in 2 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2256 place count 912 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2257 place count 912 transition count 701
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2259 place count 911 transition count 700
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 2401 place count 840 transition count 700
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2405 place count 840 transition count 696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2409 place count 836 transition count 696
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 2490 place count 836 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2491 place count 835 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2492 place count 834 transition count 695
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2492 place count 834 transition count 693
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2496 place count 832 transition count 693
Applied a total of 2496 rules in 658 ms. Remains 832 /2040 variables (removed 1208) and now considering 693/1830 (removed 1137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 658 ms. Remains : 832/2040 places, 693/1830 transitions.
RANDOM walk for 40000 steps (8 resets) in 798 ms. (50 steps per ms) remains 42/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
// Phase 1: matrix 693 rows 832 cols
[2025-06-07 16:35:02] [INFO ] Computed 330 invariants in 3 ms
[2025-06-07 16:35:02] [INFO ] State equation strengthened by 10 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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 171/237 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 49/286 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 330/616 variables, 286/380 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 320/936 variables, 192/578 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 63/641 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 3/644 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 21/957 variables, 25/669 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/957 variables, 21/690 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/957 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 26/983 variables, 13/703 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 219/1202 variables, 135/838 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 36/874 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1202 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1202 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 21 (OVERLAPS) 14/1216 variables, 17/892 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1216 variables, 14/906 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1216 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 24 (OVERLAPS) 17/1233 variables, 9/915 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1233 variables, 3/918 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1233 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 27 (OVERLAPS) 171/1404 variables, 98/1016 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1404 variables, 28/1044 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1404 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 30 (OVERLAPS) 14/1418 variables, 12/1056 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1418 variables, 10/1066 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1418 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 33 (OVERLAPS) 20/1438 variables, 10/1076 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1438 variables, 4/1080 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1438 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 36 (OVERLAPS) 72/1510 variables, 59/1139 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1510 variables, 18/1157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1510 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 39 (OVERLAPS) 15/1525 variables, 10/1167 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1525 variables, 5/1172 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1525 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 42 (OVERLAPS) 0/1525 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1525/1525 variables, and 1172 constraints, problems are : Problem set: 0 solved, 42 unsolved in 11023 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 832/832 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 171/237 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 49/286 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:14] [INFO ] Deduced a trap composed of 4 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-07 16:35:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 330/616 variables, 286/382 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 6/388 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 28/416 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 320/936 variables, 192/608 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 63/671 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 14/688 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:16] [INFO ] Deduced a trap composed of 5 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-07 16:35:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:17] [INFO ] Deduced a trap along path composed of 2 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-07 16:35:17] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:17] [INFO ] Deduced a trap along path composed of 2 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-07 16:35:17] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/936 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 21/957 variables, 25/719 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/957 variables, 21/740 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:20] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/957 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/957 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 21 (OVERLAPS) 26/983 variables, 13/754 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/983 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 23 (OVERLAPS) 219/1202 variables, 135/889 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1202 variables, 36/925 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1202 variables, 1/926 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:24] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1202 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:26] [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-07 16:35:26] [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-07 16:35:26] [INFO ] Deduced a trap along path composed of 2 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-07 16:35:26] [INFO ] Deduced a trap along path composed of 2 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-07 16:35:26] [INFO ] Deduced a trap along path composed of 2 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-07 16:35:26] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1202 variables, 6/933 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:28] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1202 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:28] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1202 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:30] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1202 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:32] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1202 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1202 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 33 (OVERLAPS) 14/1216 variables, 17/954 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1216 variables, 14/968 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1216 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 36 (OVERLAPS) 17/1233 variables, 9/977 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1233 variables, 3/980 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1233 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 39 (OVERLAPS) 171/1404 variables, 98/1078 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1404 variables, 28/1106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:41] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:41] [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-07 16:35:41] [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-07 16:35:41] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1404 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1404 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 43 (OVERLAPS) 14/1418 variables, 12/1122 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1418 variables, 10/1132 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1418 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 46 (OVERLAPS) 20/1438 variables, 10/1142 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1438 variables, 4/1146 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:49] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1438 variables, 1/1147 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:51] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:51] [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-07 16:35:51] [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-07 16:35:51] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1438 variables, 4/1151 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1438 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 51 (OVERLAPS) 72/1510 variables, 59/1210 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1510 variables, 18/1228 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:35:57] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/1525 variables, and 1229 constraints, problems are : Problem set: 0 solved, 42 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 325/330 constraints, State Equation: 822/832 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 56053ms problems are : Problem set: 0 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 832 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 832/832 places, 693/693 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 832 transition count 688
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 827 transition count 688
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 827 transition count 687
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 826 transition count 687
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 823 transition count 684
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 821 transition count 684
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 821 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 820 transition count 683
Applied a total of 24 rules in 85 ms. Remains 820 /832 variables (removed 12) and now considering 683/693 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 820/832 places, 683/693 transitions.
RANDOM walk for 40000 steps (8 resets) in 495 ms. (80 steps per ms) remains 13/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
// Phase 1: matrix 683 rows 820 cols
[2025-06-07 16:35:59] [INFO ] Computed 330 invariants in 3 ms
[2025-06-07 16:35:59] [INFO ] State equation strengthened by 10 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 49/68 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 9/77 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 105/182 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 173/355 variables, 95/196 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 22/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 23/378 variables, 23/243 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 17/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 31/409 variables, 15/275 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 221/630 variables, 125/400 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/630 variables, 25/425 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/630 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/630 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 24/654 variables, 16/442 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/654 variables, 9/451 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/654 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 28/682 variables, 12/463 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/682 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 220/902 variables, 152/615 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/902 variables, 33/648 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/902 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/902 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 17/919 variables, 18/668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/919 variables, 12/680 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/919 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 14/933 variables, 7/687 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/933 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/933 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 105/1038 variables, 68/757 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1038 variables, 14/771 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1038 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 9/1047 variables, 10/781 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1047 variables, 3/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1047 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 14/1061 variables, 6/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1061 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (OVERLAPS) 89/1150 variables, 60/850 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1150 variables, 11/861 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1150 variables, 3/864 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1150 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 4/1154 variables, 8/872 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1154 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1154 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (OVERLAPS) 37/1191 variables, 23/899 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1191 variables, 11/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1191 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (OVERLAPS) 40/1231 variables, 21/931 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1231 variables, 4/935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1231 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (OVERLAPS) 3/1234 variables, 6/941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1234 variables, 3/944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1234 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 59 (OVERLAPS) 19/1253 variables, 10/954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1253 variables, 4/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1253 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (OVERLAPS) 2/1255 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1255 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (OVERLAPS) 29/1284 variables, 17/976 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1284 variables, 3/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1284 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (OVERLAPS) 2/1286 variables, 4/983 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1286 variables, 2/985 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1286 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (OVERLAPS) 15/1301 variables, 8/993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1301 variables, 4/997 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1301 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 73 (OVERLAPS) 29/1330 variables, 15/1012 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1330 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1330 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 76 (OVERLAPS) 2/1332 variables, 4/1019 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1332 variables, 2/1021 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1332 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 79 (OVERLAPS) 15/1347 variables, 8/1029 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1347 variables, 4/1033 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1347 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 82 (OVERLAPS) 29/1376 variables, 14/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1376 variables, 1/1048 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1376 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 85 (OVERLAPS) 4/1380 variables, 6/1054 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1380 variables, 4/1058 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1380 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 88 (OVERLAPS) 18/1398 variables, 9/1067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1398 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1398 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 91 (OVERLAPS) 28/1426 variables, 15/1086 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1426 variables, 3/1089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1426 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 94 (OVERLAPS) 2/1428 variables, 4/1093 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1428 variables, 2/1095 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1428 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 97 (OVERLAPS) 15/1443 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1443 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1443 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1443 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 101 (OVERLAPS) 26/1469 variables, 14/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1469 variables, 3/1125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1469 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 104 (OVERLAPS) 2/1471 variables, 4/1129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1471 variables, 2/1131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1471 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 107 (OVERLAPS) 10/1481 variables, 6/1137 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1481 variables, 3/1140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1481 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 110 (OVERLAPS) 17/1498 variables, 8/1148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1498 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1498 variables, 1/1151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1498 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 114 (OVERLAPS) 2/1500 variables, 2/1153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1500 variables, 2/1155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1500 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 117 (OVERLAPS) 1/1501 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1501 variables, 1/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1501 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 120 (OVERLAPS) 2/1503 variables, 2/1159 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1503 variables, 1/1160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1503 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 123 (OVERLAPS) 0/1503 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1503/1503 variables, and 1160 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7302 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 820/820 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 49/68 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 9/77 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 105/182 variables, 77/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 173/355 variables, 95/202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 22/224 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 5/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 23/378 variables, 23/254 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 17/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 31/409 variables, 15/286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 221/630 variables, 125/411 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/630 variables, 25/436 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/630 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/630 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:08] [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-07 16:36:08] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 24/654 variables, 16/456 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/654 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/654 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 28/682 variables, 12/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/682 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 220/902 variables, 152/629 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/902 variables, 33/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/902 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:09] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:09] [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-07 16:36:09] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:09] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/902 variables, 4/668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/902 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 17/919 variables, 18/686 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/919 variables, 12/698 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/919 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 14/933 variables, 7/705 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/933 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/933 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 105/1038 variables, 68/775 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1038 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:10] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:10] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:10] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:11] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:11] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/1038 variables, 5/794 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1038 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 44 (OVERLAPS) 9/1047 variables, 10/804 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1047 variables, 3/807 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1047 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 47 (OVERLAPS) 14/1061 variables, 6/813 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1061 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 49 (OVERLAPS) 89/1150 variables, 60/873 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1150 variables, 11/884 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1150 variables, 3/887 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:12] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:12] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:12] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1150 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1150 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 54 (OVERLAPS) 4/1154 variables, 8/898 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1154 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1154 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 57 (OVERLAPS) 37/1191 variables, 23/925 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1191 variables, 11/936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:14] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:14] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:14] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/1191 variables, 3/939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1191 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 61 (OVERLAPS) 40/1231 variables, 21/960 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1231 variables, 4/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1231 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 64 (OVERLAPS) 3/1234 variables, 6/970 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1234 variables, 3/973 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1234 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 67 (OVERLAPS) 19/1253 variables, 10/983 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1253 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 16:36:16] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:16] [INFO ] Deduced a trap along path composed of 2 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-07 16:36:16] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 69 (INCLUDED_ONLY) 0/1253 variables, 3/990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1253 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 71 (OVERLAPS) 2/1255 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1255 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 73 (OVERLAPS) 29/1284 variables, 17/1008 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1284 variables, 3/1011 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1284 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 76 (OVERLAPS) 2/1286 variables, 4/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1286 variables, 2/1017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1286 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 79 (OVERLAPS) 15/1301 variables, 8/1025 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1301 variables, 4/1029 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1301 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 82 (OVERLAPS) 29/1330 variables, 15/1044 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1330 variables, 3/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1330 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 85 (OVERLAPS) 2/1332 variables, 4/1051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1332 variables, 2/1053 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1332 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 88 (OVERLAPS) 15/1347 variables, 8/1061 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1347 variables, 4/1065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1347 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 91 (OVERLAPS) 29/1376 variables, 14/1079 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1376 variables, 1/1080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1376 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 94 (OVERLAPS) 4/1380 variables, 6/1086 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1380 variables, 4/1090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1380 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 97 (OVERLAPS) 18/1398 variables, 9/1099 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1398 variables, 4/1103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1398 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 100 (OVERLAPS) 28/1426 variables, 15/1118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1426 variables, 3/1121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1426 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 103 (OVERLAPS) 2/1428 variables, 4/1125 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1428 variables, 2/1127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1428 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 106 (OVERLAPS) 15/1443 variables, 8/1135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1443 variables, 4/1139 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1443 variables, 1/1140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1443 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 110 (OVERLAPS) 26/1469 variables, 14/1154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1469 variables, 3/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1469 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 113 (OVERLAPS) 2/1471 variables, 4/1161 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1471 variables, 2/1163 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1471 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 116 (OVERLAPS) 10/1481 variables, 6/1169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1481 variables, 3/1172 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1481 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 119 (OVERLAPS) 17/1498 variables, 8/1180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1498 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1498 variables, 1/1183 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1498 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 123 (OVERLAPS) 2/1500 variables, 2/1185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1500 variables, 2/1187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1500 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 126 (OVERLAPS) 1/1501 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1501 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1501 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 129 (OVERLAPS) 2/1503 variables, 2/1191 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1503 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1503 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 132 (OVERLAPS) 0/1503 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1503/1503 variables, and 1192 constraints, problems are : Problem set: 0 solved, 11 unsolved in 22798 ms.
Refiners :[Positive P Invariants (semi-flows): 330/330 constraints, State Equation: 820/820 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 30112ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6834 ms.
Support contains 19 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 683/683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 820 transition count 675
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 812 transition count 675
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 16 place count 812 transition count 660
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 46 place count 797 transition count 660
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 782 transition count 645
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 90 place count 775 transition count 645
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 775 transition count 645
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 770 transition count 640
Applied a total of 98 rules in 86 ms. Remains 770 /820 variables (removed 50) and now considering 640/683 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 770/820 places, 640/683 transitions.
[2025-06-07 16:36:36] [INFO ] Flatten gal took : 57 ms
[2025-06-07 16:36:36] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:36:36] [INFO ] Input system was already deterministic with 1830 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2017 transition count 1807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2017 transition count 1807
Applied a total of 46 rules in 202 ms. Remains 2017 /2040 variables (removed 23) and now considering 1807/1830 (removed 23) transitions.
// Phase 1: matrix 1807 rows 2017 cols
[2025-06-07 16:36:37] [INFO ] Computed 331 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:36:37] [INFO ] Implicit Places using invariants in 579 ms returned []
[2025-06-07 16:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:36:39] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
Running 1806 sub problems to find dead transitions.
[2025-06-07 16:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2016/3824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1806 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2017 constraints, PredecessorRefiner: 1806/1806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2016/3824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1806 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2017 constraints, PredecessorRefiner: 0/1806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 1806 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 2017/2040 places, 1807/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62723 ms. Remains : 2017/2040 places, 1807/1830 transitions.
[2025-06-07 16:37:39] [INFO ] Flatten gal took : 42 ms
[2025-06-07 16:37:39] [INFO ] Flatten gal took : 43 ms
[2025-06-07 16:37:39] [INFO ] Input system was already deterministic with 1807 transitions.
[2025-06-07 16:37:39] [INFO ] Flatten gal took : 41 ms
[2025-06-07 16:37:40] [INFO ] Flatten gal took : 40 ms
[2025-06-07 16:37:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10138757329707192787.gal : 27 ms
[2025-06-07 16:37:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5907353174534917552.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10138757329707192787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5907353174534917552.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:38:10] [INFO ] Flatten gal took : 39 ms
[2025-06-07 16:38:10] [INFO ] Applying decomposition
[2025-06-07 16:38:10] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10627947895865283340.txt' '-o' '/tmp/graph10627947895865283340.bin' '-w' '/tmp/graph10627947895865283340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10627947895865283340.bin' '-l' '-1' '-v' '-w' '/tmp/graph10627947895865283340.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:38:10] [INFO ] Decomposing Gal with order
[2025-06-07 16:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:38:10] [INFO ] Removed a total of 295 redundant transitions.
[2025-06-07 16:38:10] [INFO ] Flatten gal took : 131 ms
[2025-06-07 16:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-06-07 16:38:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9113523409634850149.gal : 24 ms
[2025-06-07 16:38:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13966671472485041809.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/CTLFireability9113523409634850149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13966671472485041809.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 427 place count 2039 transition count 1402
Reduce places removed 427 places and 0 transitions.
Iterating post reduction 1 with 427 rules applied. Total rules applied 854 place count 1612 transition count 1402
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 854 place count 1612 transition count 1178
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 2 with 448 rules applied. Total rules applied 1302 place count 1388 transition count 1178
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1320 place count 1370 transition count 1160
Iterating global reduction 2 with 18 rules applied. Total rules applied 1338 place count 1370 transition count 1160
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1338 place count 1370 transition count 1147
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1364 place count 1357 transition count 1147
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 0 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2326 place count 876 transition count 666
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2327 place count 876 transition count 665
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2329 place count 875 transition count 664
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 873 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2332 place count 872 transition count 662
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2332 place count 872 transition count 660
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2336 place count 870 transition count 660
Applied a total of 2336 rules in 305 ms. Remains 870 /2040 variables (removed 1170) and now considering 660/1830 (removed 1170) transitions.
// Phase 1: matrix 660 rows 870 cols
[2025-06-07 16:38:41] [INFO ] Computed 330 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:38:41] [INFO ] Implicit Places using invariants in 369 ms returned [850, 854]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 372 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 868/2040 places, 660/1830 transitions.
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 4 place count 866 transition count 658
Applied a total of 4 rules in 37 ms. Remains 866 /868 variables (removed 2) and now considering 658/660 (removed 2) transitions.
// Phase 1: matrix 658 rows 866 cols
[2025-06-07 16:38:41] [INFO ] Computed 328 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:38:42] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-06-07 16:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:38:42] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 866/2040 places, 658/1830 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1713 ms. Remains : 866/2040 places, 658/1830 transitions.
[2025-06-07 16:38:42] [INFO ] Flatten gal took : 17 ms
[2025-06-07 16:38:42] [INFO ] Flatten gal took : 18 ms
[2025-06-07 16:38:42] [INFO ] Input system was already deterministic with 658 transitions.
[2025-06-07 16:38:42] [INFO ] Flatten gal took : 18 ms
[2025-06-07 16:38:42] [INFO ] Flatten gal took : 18 ms
[2025-06-07 16:38:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13616365698446743786.gal : 3 ms
[2025-06-07 16:38:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14942999108417504400.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/CTLFireability13616365698446743786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14942999108417504400.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15412e+128,2.86395,98640,2,1632,5,367124,6,0,4124,640070,0
Converting to forward existential form...Done !
original formula: EG((AG(AF((((p531==0)||(p590==0))||(p631==0)))) + AG((p468==0))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EG(!((((p531==0)||(p590==0))||(p631==0)))))))) + !(E(TRUE U !((p468==0))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t24, t226, t230, t562, Intersection with reachable at each step enabled. (destroyed/reverse/...184
Detected timeout of ITS tools.
[2025-06-07 16:39:12] [INFO ] Flatten gal took : 17 ms
[2025-06-07 16:39:12] [INFO ] Applying decomposition
[2025-06-07 16:39:12] [INFO ] Flatten gal took : 17 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/graph7331082968386154744.txt' '-o' '/tmp/graph7331082968386154744.bin' '-w' '/tmp/graph7331082968386154744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7331082968386154744.bin' '-l' '-1' '-v' '-w' '/tmp/graph7331082968386154744.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:39:12] [INFO ] Decomposing Gal with order
[2025-06-07 16:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:39:13] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-07 16:39:13] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2025-06-07 16:39:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15576888098388562008.gal : 6 ms
[2025-06-07 16:39:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17421456171637031870.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/CTLFireability15576888098388562008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17421456171637031870.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15412e+128,25.2414,688576,177,23,1.2055e+06,206,981,3.93035e+06,44,1008,0
Converting to forward existential form...Done !
original formula: EG((AG(AF((((i6.u54.p531==0)||(i7.u60.p590==0))||(i8.i0.i1.u65.p631==0)))) + AG((i5.u46.p468==0))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EG(!((((i6.u54.p531==0)||(i7.u60.p590==0))||(i8.i0.i1.u65.p631==0)))))))) + !(E(TRUE ...190
Reverse transition relation is NOT exact ! Due to transitions i7.t562, i7.u63.t230, i7.u62.t226, i7.u69.t24, Intersection with reachable at each step enab...208
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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
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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2013 transition count 1803
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2013 transition count 1803
Applied a total of 54 rules in 198 ms. Remains 2013 /2040 variables (removed 27) and now considering 1803/1830 (removed 27) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2025-06-07 16:39:43] [INFO ] Computed 331 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:39:43] [INFO ] Implicit Places using invariants in 585 ms returned []
[2025-06-07 16:39:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:39:45] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 1802 sub problems to find dead transitions.
[2025-06-07 16:39:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1300 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0timeout
)
(s1301 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 1802/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1802 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 0/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 1802 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 2013/2040 places, 1803/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62702 ms. Remains : 2013/2040 places, 1803/1830 transitions.
[2025-06-07 16:40:45] [INFO ] Flatten gal took : 45 ms
[2025-06-07 16:40:45] [INFO ] Flatten gal took : 32 ms
[2025-06-07 16:40:45] [INFO ] Input system was already deterministic with 1803 transitions.
[2025-06-07 16:40:45] [INFO ] Flatten gal took : 32 ms
[2025-06-07 16:40:46] [INFO ] Flatten gal took : 38 ms
[2025-06-07 16:40:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17767862145125176196.gal : 6 ms
[2025-06-07 16:40:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2020489845832107994.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/CTLFireability17767862145125176196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2020489845832107994.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:41:16] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:41:16] [INFO ] Applying decomposition
[2025-06-07 16:41:16] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2809994076161220375.txt' '-o' '/tmp/graph2809994076161220375.bin' '-w' '/tmp/graph2809994076161220375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2809994076161220375.bin' '-l' '-1' '-v' '-w' '/tmp/graph2809994076161220375.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:41:16] [INFO ] Decomposing Gal with order
[2025-06-07 16:41:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:41:16] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 16:41:16] [INFO ] Flatten gal took : 66 ms
[2025-06-07 16:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-07 16:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14067489597270737201.gal : 13 ms
[2025-06-07 16:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8838630597829735775.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/CTLFireability14067489597270737201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8838630597829735775.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 429 place count 2039 transition count 1400
Reduce places removed 429 places and 0 transitions.
Iterating post reduction 1 with 429 rules applied. Total rules applied 858 place count 1610 transition count 1400
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 223 Pre rules applied. Total rules applied 858 place count 1610 transition count 1177
Deduced a syphon composed of 223 places in 2 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 2 with 446 rules applied. Total rules applied 1304 place count 1387 transition count 1177
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1322 place count 1369 transition count 1159
Iterating global reduction 2 with 18 rules applied. Total rules applied 1340 place count 1369 transition count 1159
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1340 place count 1369 transition count 1146
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1366 place count 1356 transition count 1146
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 2328 place count 875 transition count 665
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2329 place count 875 transition count 664
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 874 transition count 663
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2333 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2334 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2334 place count 871 transition count 659
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2338 place count 869 transition count 659
Applied a total of 2338 rules in 257 ms. Remains 869 /2040 variables (removed 1171) and now considering 659/1830 (removed 1171) transitions.
// Phase 1: matrix 659 rows 869 cols
[2025-06-07 16:41:46] [INFO ] Computed 330 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:41:47] [INFO ] Implicit Places using invariants in 347 ms returned [849, 853]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 348 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 867/2040 places, 659/1830 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 865 transition count 657
Applied a total of 4 rules in 36 ms. Remains 865 /867 variables (removed 2) and now considering 657/659 (removed 2) transitions.
// Phase 1: matrix 657 rows 865 cols
[2025-06-07 16:41:47] [INFO ] Computed 328 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:41:47] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-07 16:41:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:41:48] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 865/2040 places, 657/1830 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1640 ms. Remains : 865/2040 places, 657/1830 transitions.
[2025-06-07 16:41:48] [INFO ] Flatten gal took : 13 ms
[2025-06-07 16:41:48] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:41:48] [INFO ] Input system was already deterministic with 657 transitions.
[2025-06-07 16:41:48] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:41:48] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14797100226876273019.gal : 3 ms
[2025-06-07 16:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13048642763228063093.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/CTLFireability14797100226876273019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13048642763228063093.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,2.66011e+128,2.30918,81644,2,1577,5,303216,6,0,4120,522194,0
Converting to forward existential form...Done !
original formula: AG((AG((p130==0)) * EG((p226==0))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((p130==0)))] = FALSE * [(FwdU(Init,TRUE) * !(EG((p226==0))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 655/0/2
Detected timeout of ITS tools.
[2025-06-07 16:42:18] [INFO ] Flatten gal took : 19 ms
[2025-06-07 16:42:18] [INFO ] Applying decomposition
[2025-06-07 16:42:18] [INFO ] Flatten gal took : 14 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/graph10673355761256811811.txt' '-o' '/tmp/graph10673355761256811811.bin' '-w' '/tmp/graph10673355761256811811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10673355761256811811.bin' '-l' '-1' '-v' '-w' '/tmp/graph10673355761256811811.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:42:18] [INFO ] Decomposing Gal with order
[2025-06-07 16:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:42:18] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-07 16:42:18] [INFO ] Flatten gal took : 22 ms
[2025-06-07 16:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-07 16:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15876676337818213215.gal : 4 ms
[2025-06-07 16:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8581653543635954819.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/CTLFireability15876676337818213215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8581653543635954819.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,2.66011e+128,26.694,768892,164,17,1.38997e+06,200,998,4.74724e+06,43,1009,0
Converting to forward existential form...Done !
original formula: AG((AG((i1.u11.p130==0)) * EG((i4.u22.p226==0))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((i1.u11.p130==0)))] = FALSE * [(FwdU(Init,TRUE) * !(EG((i4.u22.p226==0))))] = ...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2011 transition count 1801
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2011 transition count 1801
Applied a total of 58 rules in 208 ms. Remains 2011 /2040 variables (removed 29) and now considering 1801/1830 (removed 29) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2025-06-07 16:42:48] [INFO ] Computed 331 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:42:49] [INFO ] Implicit Places using invariants in 567 ms returned []
[2025-06-07 16:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:42:50] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:42:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2040 places, 1801/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62694 ms. Remains : 2011/2040 places, 1801/1830 transitions.
[2025-06-07 16:43:51] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:43:51] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:43:51] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:43:51] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:43:51] [INFO ] Flatten gal took : 42 ms
[2025-06-07 16:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8854258882411722866.gal : 6 ms
[2025-06-07 16:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7156455327747798156.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/CTLFireability8854258882411722866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7156455327747798156.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:44:21] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:44:21] [INFO ] Applying decomposition
[2025-06-07 16:44:21] [INFO ] Flatten gal took : 30 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/graph4582234655657301398.txt' '-o' '/tmp/graph4582234655657301398.bin' '-w' '/tmp/graph4582234655657301398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4582234655657301398.bin' '-l' '-1' '-v' '-w' '/tmp/graph4582234655657301398.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:44:21] [INFO ] Decomposing Gal with order
[2025-06-07 16:44:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:44:21] [INFO ] Removed a total of 299 redundant transitions.
[2025-06-07 16:44:21] [INFO ] Flatten gal took : 58 ms
[2025-06-07 16:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 16:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6644511385090692234.gal : 13 ms
[2025-06-07 16:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8556924105376409484.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/CTLFireability6644511385090692234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8556924105376409484.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 2039 transition count 1401
Reduce places removed 428 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 429 rules applied. Total rules applied 857 place count 1611 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 858 place count 1610 transition count 1400
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 858 place count 1610 transition count 1176
Deduced a syphon composed of 224 places in 2 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1306 place count 1386 transition count 1176
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1324 place count 1368 transition count 1158
Iterating global reduction 3 with 18 rules applied. Total rules applied 1342 place count 1368 transition count 1158
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1342 place count 1368 transition count 1145
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1368 place count 1355 transition count 1145
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 1 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 3 with 964 rules applied. Total rules applied 2332 place count 873 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2333 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2335 place count 872 transition count 661
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 place count 870 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2338 place count 869 transition count 659
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2338 place count 869 transition count 657
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2342 place count 867 transition count 657
Applied a total of 2342 rules in 240 ms. Remains 867 /2040 variables (removed 1173) and now considering 657/1830 (removed 1173) transitions.
// Phase 1: matrix 657 rows 867 cols
[2025-06-07 16:44:52] [INFO ] Computed 330 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:44:52] [INFO ] Implicit Places using invariants in 356 ms returned [847, 851]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 357 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 865/2040 places, 657/1830 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 863 transition count 655
Applied a total of 4 rules in 33 ms. Remains 863 /865 variables (removed 2) and now considering 655/657 (removed 2) transitions.
// Phase 1: matrix 655 rows 863 cols
[2025-06-07 16:44:52] [INFO ] Computed 328 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:44:52] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-07 16:44:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:44:53] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 863/2040 places, 655/1830 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1591 ms. Remains : 863/2040 places, 655/1830 transitions.
[2025-06-07 16:44:53] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:44:53] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:44:53] [INFO ] Input system was already deterministic with 655 transitions.
RANDOM walk for 2900 steps (0 resets) in 37 ms. (76 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 16:44:53] [INFO ] Flatten gal took : 22 ms
[2025-06-07 16:44:53] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:44:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality712746429354598420.gal : 3 ms
[2025-06-07 16:44:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5896733198198223208.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality712746429354598420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5896733198198223208.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 2015 transition count 1805
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 2015 transition count 1805
Applied a total of 50 rules in 209 ms. Remains 2015 /2040 variables (removed 25) and now considering 1805/1830 (removed 25) transitions.
// Phase 1: matrix 1805 rows 2015 cols
[2025-06-07 16:44:53] [INFO ] Computed 331 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:44:54] [INFO ] Implicit Places using invariants in 558 ms returned []
[2025-06-07 16:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:44:55] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
Running 1804 sub problems to find dead transitions.
[2025-06-07 16:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2014/3820 variables, and 0 constraints, problems are : Problem set: 0 solved, 1804 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2015 constraints, PredecessorRefiner: 1804/1804 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2014/3820 variables, and 0 constraints, problems are : Problem set: 0 solved, 1804 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2015 constraints, PredecessorRefiner: 0/1804 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1804 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 2015/2040 places, 1805/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62683 ms. Remains : 2015/2040 places, 1805/1830 transitions.
[2025-06-07 16:45:56] [INFO ] Flatten gal took : 32 ms
[2025-06-07 16:45:56] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:45:56] [INFO ] Input system was already deterministic with 1805 transitions.
[2025-06-07 16:45:56] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:45:56] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:45:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3624007082439528446.gal : 5 ms
[2025-06-07 16:45:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7269306789880555332.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/CTLFireability3624007082439528446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7269306789880555332.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:46:26] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:46:26] [INFO ] Applying decomposition
[2025-06-07 16:46:26] [INFO ] Flatten gal took : 30 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/graph10531577425979365981.txt' '-o' '/tmp/graph10531577425979365981.bin' '-w' '/tmp/graph10531577425979365981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10531577425979365981.bin' '-l' '-1' '-v' '-w' '/tmp/graph10531577425979365981.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:46:26] [INFO ] Decomposing Gal with order
[2025-06-07 16:46:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:46:26] [INFO ] Removed a total of 297 redundant transitions.
[2025-06-07 16:46:26] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:46:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability43502323187049112.gal : 11 ms
[2025-06-07 16:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12793764478576286573.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/CTLFireability43502323187049112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12793764478576286573.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2012 transition count 1802
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2012 transition count 1802
Applied a total of 56 rules in 217 ms. Remains 2012 /2040 variables (removed 28) and now considering 1802/1830 (removed 28) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2025-06-07 16:46:57] [INFO ] Computed 331 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:46:57] [INFO ] Implicit Places using invariants in 566 ms returned []
[2025-06-07 16:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:46:59] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
Running 1801 sub problems to find dead transitions.
[2025-06-07 16:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Starting structural reductions in LTL mode, iteration 1 : 2012/2040 places, 1802/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62698 ms. Remains : 2012/2040 places, 1802/1830 transitions.
[2025-06-07 16:47:59] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:47:59] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:47:59] [INFO ] Input system was already deterministic with 1802 transitions.
[2025-06-07 16:47:59] [INFO ] Flatten gal took : 38 ms
[2025-06-07 16:47:59] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:47:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12025866218128383148.gal : 5 ms
[2025-06-07 16:47:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12125571722077364623.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/CTLFireability12025866218128383148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12125571722077364623.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:48:30] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:48:30] [INFO ] Applying decomposition
[2025-06-07 16:48:30] [INFO ] Flatten gal took : 30 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/graph839269006758896001.txt' '-o' '/tmp/graph839269006758896001.bin' '-w' '/tmp/graph839269006758896001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph839269006758896001.bin' '-l' '-1' '-v' '-w' '/tmp/graph839269006758896001.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:48:30] [INFO ] Decomposing Gal with order
[2025-06-07 16:48:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:48:30] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 16:48:30] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:48:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:48:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15353327542162076564.gal : 12 ms
[2025-06-07 16:48:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17044559057643557050.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/CTLFireability15353327542162076564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17044559057643557050.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 2039 transition count 1414
Reduce places removed 415 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 419 rules applied. Total rules applied 834 place count 1624 transition count 1410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 838 place count 1620 transition count 1410
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 838 place count 1620 transition count 1187
Deduced a syphon composed of 223 places in 2 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1284 place count 1397 transition count 1187
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1300 place count 1381 transition count 1171
Iterating global reduction 3 with 16 rules applied. Total rules applied 1316 place count 1381 transition count 1171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1316 place count 1381 transition count 1159
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1340 place count 1369 transition count 1159
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 473
Deduced a syphon composed of 473 places in 1 ms
Reduce places removed 473 places and 0 transitions.
Iterating global reduction 3 with 946 rules applied. Total rules applied 2286 place count 896 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2287 place count 896 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2289 place count 895 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2291 place count 893 transition count 682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2292 place count 892 transition count 682
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2292 place count 892 transition count 680
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2296 place count 890 transition count 680
Applied a total of 2296 rules in 245 ms. Remains 890 /2040 variables (removed 1150) and now considering 680/1830 (removed 1150) transitions.
// Phase 1: matrix 680 rows 890 cols
[2025-06-07 16:49:00] [INFO ] Computed 330 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:49:01] [INFO ] Implicit Places using invariants in 359 ms returned [870, 874]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 360 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 888/2040 places, 680/1830 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 886 transition count 678
Applied a total of 4 rules in 34 ms. Remains 886 /888 variables (removed 2) and now considering 678/680 (removed 2) transitions.
// Phase 1: matrix 678 rows 886 cols
[2025-06-07 16:49:01] [INFO ] Computed 328 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:49:01] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-06-07 16:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:49:02] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 886/2040 places, 678/1830 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1633 ms. Remains : 886/2040 places, 678/1830 transitions.
[2025-06-07 16:49:02] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:49:02] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:49:02] [INFO ] Input system was already deterministic with 678 transitions.
[2025-06-07 16:49:02] [INFO ] Flatten gal took : 14 ms
[2025-06-07 16:49:02] [INFO ] Flatten gal took : 15 ms
[2025-06-07 16:49:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10448002838115705712.gal : 3 ms
[2025-06-07 16:49:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4982358813420535576.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/CTLFireability10448002838115705712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4982358813420535576.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.13516e+129,6.12342,188916,2,2747,5,725341,6,0,4219,1.31328e+06,0
Converting to forward existential form...Done !
original formula: E((((p1615==1) * A(((((p1209==1)&&(p1229==1))||(p1746==1))||(((p2134==1)&&(p2136==1))&&(p2162==1))) U AG((p176==1)))) * ((p401==1) * ((p9...317
=> equivalent forward existential formula: [(FwdU(Init,(((p1615==1) * !((E(!(!(E(TRUE U !((p176==1))))) U (!(((((p1209==1)&&(p1229==1))||(p1746==1))||(((p2...478
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...978
Detected timeout of ITS tools.
[2025-06-07 16:49:32] [INFO ] Flatten gal took : 18 ms
[2025-06-07 16:49:32] [INFO ] Applying decomposition
[2025-06-07 16:49:32] [INFO ] Flatten gal took : 15 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/graph2583915810470935877.txt' '-o' '/tmp/graph2583915810470935877.bin' '-w' '/tmp/graph2583915810470935877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2583915810470935877.bin' '-l' '-1' '-v' '-w' '/tmp/graph2583915810470935877.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:49:32] [INFO ] Decomposing Gal with order
[2025-06-07 16:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:49:32] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-07 16:49:32] [INFO ] Flatten gal took : 22 ms
[2025-06-07 16:49:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2025-06-07 16:49:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2199159600746663102.gal : 4 ms
[2025-06-07 16:49:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15889531629451239888.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/CTLFireability2199159600746663102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15889531629451239888.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.13516e+129,24.8482,649316,472,47,1.12374e+06,349,1101,3.9158e+06,69,1874,0
Converting to forward existential form...Done !
original formula: E((((i16.i1.i0.u171.p1615==1) * A(((((i13.i0.i0.u128.p1209==1)&&(i13.i0.i2.u130.p1229==1))||(i17.i0.i3.u186.p1746==1))||(((i20.i0.i0.u227...573
=> equivalent forward existential formula: [(FwdU(Init,(((i16.i1.i0.u171.p1615==1) * !((E(!(!(E(TRUE U !((i1.u16.p176==1))))) U (!(((((i13.i0.i0.u128.p1209...748
Reverse transition relation is NOT exact ! Due to transitions i0.t173, i0.t172, i0.u6.t168, i0.u3.t1, i0.u5.t164, i0.u4.t2, i0.u8.t528, i0.u2.t0, i0.u7.t17...2544
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 2017 transition count 1807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 2017 transition count 1807
Applied a total of 46 rules in 208 ms. Remains 2017 /2040 variables (removed 23) and now considering 1807/1830 (removed 23) transitions.
// Phase 1: matrix 1807 rows 2017 cols
[2025-06-07 16:50:02] [INFO ] Computed 331 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:50:03] [INFO ] Implicit Places using invariants in 576 ms returned []
[2025-06-07 16:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:50:04] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Running 1806 sub problems to find dead transitions.
[2025-06-07 16:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2016/3824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1806 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2017 constraints, PredecessorRefiner: 1806/1806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2016/3824 variables, and 0 constraints, problems are : Problem set: 0 solved, 1806 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2017 constraints, PredecessorRefiner: 0/1806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1806 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 2017/2040 places, 1807/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62681 ms. Remains : 2017/2040 places, 1807/1830 transitions.
[2025-06-07 16:51:05] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:51:05] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:51:05] [INFO ] Input system was already deterministic with 1807 transitions.
[2025-06-07 16:51:05] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:51:05] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:51:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14391269938808352433.gal : 5 ms
[2025-06-07 16:51:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13216202796715740605.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/CTLFireability14391269938808352433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13216202796715740605.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:51:35] [INFO ] Flatten gal took : 31 ms
[2025-06-07 16:51:35] [INFO ] Applying decomposition
[2025-06-07 16:51:35] [INFO ] Flatten gal took : 30 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/graph14968876186333896204.txt' '-o' '/tmp/graph14968876186333896204.bin' '-w' '/tmp/graph14968876186333896204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14968876186333896204.bin' '-l' '-1' '-v' '-w' '/tmp/graph14968876186333896204.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:51:35] [INFO ] Decomposing Gal with order
[2025-06-07 16:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:51:35] [INFO ] Removed a total of 293 redundant transitions.
[2025-06-07 16:51:35] [INFO ] Flatten gal took : 54 ms
[2025-06-07 16:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:51:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17234970894184478252.gal : 10 ms
[2025-06-07 16:51:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16957363607074334651.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/CTLFireability17234970894184478252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16957363607074334651.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2011 transition count 1801
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2011 transition count 1801
Applied a total of 58 rules in 206 ms. Remains 2011 /2040 variables (removed 29) and now considering 1801/1830 (removed 29) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2025-06-07 16:52:05] [INFO ] Computed 331 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:06] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-06-07 16:52:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:52:08] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 16:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2040 places, 1801/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62694 ms. Remains : 2011/2040 places, 1801/1830 transitions.
[2025-06-07 16:53:08] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:53:08] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:53:08] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 16:53:08] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:53:08] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:53:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15000614412470533308.gal : 6 ms
[2025-06-07 16:53:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2250853342671211483.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/CTLFireability15000614412470533308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2250853342671211483.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:53:38] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:53:38] [INFO ] Applying decomposition
[2025-06-07 16:53:38] [INFO ] Flatten gal took : 30 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/graph16062331457815091649.txt' '-o' '/tmp/graph16062331457815091649.bin' '-w' '/tmp/graph16062331457815091649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16062331457815091649.bin' '-l' '-1' '-v' '-w' '/tmp/graph16062331457815091649.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:53:38] [INFO ] Decomposing Gal with order
[2025-06-07 16:53:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:53:39] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-07 16:53:39] [INFO ] Flatten gal took : 51 ms
[2025-06-07 16:53:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:53:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12150982822621937696.gal : 10 ms
[2025-06-07 16:53:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16709991704112195734.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/CTLFireability12150982822621937696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16709991704112195734.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2014 transition count 1804
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2014 transition count 1804
Applied a total of 52 rules in 197 ms. Remains 2014 /2040 variables (removed 26) and now considering 1804/1830 (removed 26) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2025-06-07 16:54:09] [INFO ] Computed 331 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:54:09] [INFO ] Implicit Places using invariants in 573 ms returned []
[2025-06-07 16:54:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:54:11] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
Running 1803 sub problems to find dead transitions.
[2025-06-07 16:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2013/3818 variables, and 0 constraints, problems are : Problem set: 0 solved, 1803 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2014 constraints, PredecessorRefiner: 1803/1803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2013/3818 variables, and 0 constraints, problems are : Problem set: 0 solved, 1803 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2014 constraints, PredecessorRefiner: 0/1803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 1803 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 2014/2040 places, 1804/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62675 ms. Remains : 2014/2040 places, 1804/1830 transitions.
[2025-06-07 16:55:11] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:55:11] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:55:11] [INFO ] Input system was already deterministic with 1804 transitions.
[2025-06-07 16:55:11] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:55:11] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:55:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7956730117709557082.gal : 6 ms
[2025-06-07 16:55:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2047317280340915989.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/CTLFireability7956730117709557082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2047317280340915989.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:55:42] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:55:42] [INFO ] Applying decomposition
[2025-06-07 16:55:42] [INFO ] Flatten gal took : 30 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/graph5904961532553132036.txt' '-o' '/tmp/graph5904961532553132036.bin' '-w' '/tmp/graph5904961532553132036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5904961532553132036.bin' '-l' '-1' '-v' '-w' '/tmp/graph5904961532553132036.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:55:42] [INFO ] Decomposing Gal with order
[2025-06-07 16:55:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:55:42] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-07 16:55:42] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:55:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 16:55:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13884455241625778868.gal : 11 ms
[2025-06-07 16:55:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6212198235981206716.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/CTLFireability13884455241625778868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6212198235981206716.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2014 transition count 1804
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2014 transition count 1804
Applied a total of 52 rules in 213 ms. Remains 2014 /2040 variables (removed 26) and now considering 1804/1830 (removed 26) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2025-06-07 16:56:12] [INFO ] Computed 331 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:56:13] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-06-07 16:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:56:14] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
Running 1803 sub problems to find dead transitions.
[2025-06-07 16:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2013/3818 variables, and 0 constraints, problems are : Problem set: 0 solved, 1803 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2014 constraints, PredecessorRefiner: 1803/1803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2013/3818 variables, and 0 constraints, problems are : Problem set: 0 solved, 1803 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2014 constraints, PredecessorRefiner: 0/1803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 1803 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in LTL mode, iteration 1 : 2014/2040 places, 1804/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62705 ms. Remains : 2014/2040 places, 1804/1830 transitions.
[2025-06-07 16:57:15] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:57:15] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:57:15] [INFO ] Input system was already deterministic with 1804 transitions.
[2025-06-07 16:57:15] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:57:15] [INFO ] Flatten gal took : 34 ms
[2025-06-07 16:57:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6971264000975457743.gal : 5 ms
[2025-06-07 16:57:15] [INFO ] Time to serialize properties into /tmp/CTLFireability67195620243029372.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/CTLFireability6971264000975457743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability67195620243029372.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:57:45] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:57:45] [INFO ] Applying decomposition
[2025-06-07 16:57:45] [INFO ] Flatten gal took : 29 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/graph11190036623122230881.txt' '-o' '/tmp/graph11190036623122230881.bin' '-w' '/tmp/graph11190036623122230881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11190036623122230881.bin' '-l' '-1' '-v' '-w' '/tmp/graph11190036623122230881.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:57:45] [INFO ] Decomposing Gal with order
[2025-06-07 16:57:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:57:45] [INFO ] Removed a total of 293 redundant transitions.
[2025-06-07 16:57:45] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 16:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18048027395009818293.gal : 10 ms
[2025-06-07 16:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13970017815510464256.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/CTLFireability18048027395009818293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13970017815510464256.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2012 transition count 1802
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2012 transition count 1802
Applied a total of 56 rules in 210 ms. Remains 2012 /2040 variables (removed 28) and now considering 1802/1830 (removed 28) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2025-06-07 16:58:16] [INFO ] Computed 331 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:58:16] [INFO ] Implicit Places using invariants in 557 ms returned []
[2025-06-07 16:58:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 16:58:18] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
Running 1801 sub problems to find dead transitions.
[2025-06-07 16:58:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2011/3814 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2012 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in LTL mode, iteration 1 : 2012/2040 places, 1802/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62697 ms. Remains : 2012/2040 places, 1802/1830 transitions.
[2025-06-07 16:59:18] [INFO ] Flatten gal took : 28 ms
[2025-06-07 16:59:18] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:59:18] [INFO ] Input system was already deterministic with 1802 transitions.
[2025-06-07 16:59:18] [INFO ] Flatten gal took : 30 ms
[2025-06-07 16:59:18] [INFO ] Flatten gal took : 29 ms
[2025-06-07 16:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17024686535183283948.gal : 6 ms
[2025-06-07 16:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16098903437769408835.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/CTLFireability17024686535183283948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16098903437769408835.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 16:59:48] [INFO ] Flatten gal took : 33 ms
[2025-06-07 16:59:48] [INFO ] Applying decomposition
[2025-06-07 16:59:48] [INFO ] Flatten gal took : 30 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/graph4206942258398716531.txt' '-o' '/tmp/graph4206942258398716531.bin' '-w' '/tmp/graph4206942258398716531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4206942258398716531.bin' '-l' '-1' '-v' '-w' '/tmp/graph4206942258398716531.weights' '-q' '0' '-e' '0.001'
[2025-06-07 16:59:48] [INFO ] Decomposing Gal with order
[2025-06-07 16:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 16:59:49] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 16:59:49] [INFO ] Flatten gal took : 53 ms
[2025-06-07 16:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 16:59:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5583501506409934428.gal : 11 ms
[2025-06-07 16:59:49] [INFO ] Time to serialize properties into /tmp/CTLFireability609098499101002496.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/CTLFireability5583501506409934428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability609098499101002496.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2011 transition count 1801
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2011 transition count 1801
Applied a total of 58 rules in 206 ms. Remains 2011 /2040 variables (removed 29) and now considering 1801/1830 (removed 29) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2025-06-07 17:00:19] [INFO ] Computed 331 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:00:20] [INFO ] Implicit Places using invariants in 574 ms returned []
[2025-06-07 17:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:00:21] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Running 1800 sub problems to find dead transitions.
[2025-06-07 17:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 1800/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1800 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2010/3812 variables, and 0 constraints, problems are : Problem set: 0 solved, 1800 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2011 constraints, PredecessorRefiner: 0/1800 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 1800 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 2011/2040 places, 1801/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62675 ms. Remains : 2011/2040 places, 1801/1830 transitions.
[2025-06-07 17:01:21] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:01:21] [INFO ] Flatten gal took : 37 ms
[2025-06-07 17:01:22] [INFO ] Input system was already deterministic with 1801 transitions.
[2025-06-07 17:01:22] [INFO ] Flatten gal took : 30 ms
[2025-06-07 17:01:22] [INFO ] Flatten gal took : 30 ms
[2025-06-07 17:01:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11522069960121936388.gal : 5 ms
[2025-06-07 17:01:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15603328080283782418.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/CTLFireability11522069960121936388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15603328080283782418.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 17:01:52] [INFO ] Flatten gal took : 32 ms
[2025-06-07 17:01:52] [INFO ] Applying decomposition
[2025-06-07 17:01:52] [INFO ] Flatten gal took : 29 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/graph7321679966633667000.txt' '-o' '/tmp/graph7321679966633667000.bin' '-w' '/tmp/graph7321679966633667000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7321679966633667000.bin' '-l' '-1' '-v' '-w' '/tmp/graph7321679966633667000.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:01:52] [INFO ] Decomposing Gal with order
[2025-06-07 17:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:01:52] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-07 17:01:52] [INFO ] Flatten gal took : 53 ms
[2025-06-07 17:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 17:01:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16137887343647119897.gal : 11 ms
[2025-06-07 17:01:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2259950257100087904.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/CTLFireability16137887343647119897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2259950257100087904.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2040/2040 places, 1830/1830 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2013 transition count 1803
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2013 transition count 1803
Applied a total of 54 rules in 200 ms. Remains 2013 /2040 variables (removed 27) and now considering 1803/1830 (removed 27) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2025-06-07 17:02:22] [INFO ] Computed 331 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:02:23] [INFO ] Implicit Places using invariants in 563 ms returned []
[2025-06-07 17:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:02:24] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
Running 1802 sub problems to find dead transitions.
[2025-06-07 17:02:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 1802/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1802 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2012/3816 variables, and 0 constraints, problems are : Problem set: 0 solved, 1802 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2013 constraints, PredecessorRefiner: 0/1802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 1802 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Starting structural reductions in LTL mode, iteration 1 : 2013/2040 places, 1803/1830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62638 ms. Remains : 2013/2040 places, 1803/1830 transitions.
[2025-06-07 17:03:25] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:03:25] [INFO ] Flatten gal took : 37 ms
[2025-06-07 17:03:25] [INFO ] Input system was already deterministic with 1803 transitions.
[2025-06-07 17:03:25] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:03:25] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:03:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17012707341501081793.gal : 5 ms
[2025-06-07 17:03:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9151758213062850801.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/CTLFireability17012707341501081793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9151758213062850801.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 17:03:55] [INFO ] Flatten gal took : 29 ms
[2025-06-07 17:03:55] [INFO ] Applying decomposition
[2025-06-07 17:03:55] [INFO ] Flatten gal took : 30 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/graph9742885307748267733.txt' '-o' '/tmp/graph9742885307748267733.bin' '-w' '/tmp/graph9742885307748267733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9742885307748267733.bin' '-l' '-1' '-v' '-w' '/tmp/graph9742885307748267733.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:03:55] [INFO ] Decomposing Gal with order
[2025-06-07 17:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:03:55] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 17:03:55] [INFO ] Flatten gal took : 49 ms
[2025-06-07 17:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 17:03:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10483574111465328985.gal : 10 ms
[2025-06-07 17:03:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6504426452418974019.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/CTLFireability10483574111465328985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6504426452418974019.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 17:04:25] [INFO ] Flatten gal took : 31 ms
[2025-06-07 17:04:26] [INFO ] Flatten gal took : 32 ms
[2025-06-07 17:04:26] [INFO ] Applying decomposition
[2025-06-07 17:04:26] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2608624347829306358.txt' '-o' '/tmp/graph2608624347829306358.bin' '-w' '/tmp/graph2608624347829306358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2608624347829306358.bin' '-l' '-1' '-v' '-w' '/tmp/graph2608624347829306358.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:04:26] [INFO ] Decomposing Gal with order
[2025-06-07 17:04:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:04:26] [INFO ] Removed a total of 283 redundant transitions.
[2025-06-07 17:04:26] [INFO ] Flatten gal took : 54 ms
[2025-06-07 17:04:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 17:04:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3847903317535113983.gal : 12 ms
[2025-06-07 17:04:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17770990086669361023.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/CTLFireability3847903317535113983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17770990086669361023.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 15 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-174894533600898"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;