About the Execution of ITS-Tools for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.512 | 3600000.00 | 4127734.00 | 1352.70 | ?????T?????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000386.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-COL-S05J60, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000386
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J60-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716925214587
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202405141337
[2024-05-28 19:40:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:40:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:40:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:40:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 654 ms
[2024-05-28 19:40:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
[2024-05-28 19:40:16] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 19:40:16] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (3209 resets) in 1580 ms. (25 steps per ms) remains 22/44 properties
BEST_FIRST walk for 4002 steps (98 resets) in 124 ms. (32 steps per ms) remains 8/22 properties
BEST_FIRST walk for 4001 steps (104 resets) in 69 ms. (57 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4002 steps (141 resets) in 46 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4002 steps (96 resets) in 56 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4002 steps (85 resets) in 41 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (155 resets) in 38 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4002 steps (101 resets) in 16 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (112 resets) in 22 ms. (174 steps per ms) remains 7/7 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:40:17] [INFO ] Computed 13 invariants in 7 ms
[2024-05-28 19:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/31 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Real declared 47/86 variables, and 12 constraints, problems are : Problem set: 7 solved, 0 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2024-05-28 19:40:17] [INFO ] Flatten gal took : 20 ms
[2024-05-28 19:40:17] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:40:17] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 55 ms.
[2024-05-28 19:40:17] [INFO ] Unfolded 16 HLPN properties in 1 ms.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 19:40:17] [INFO ] Reduced 90 identical enabling conditions.
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 909 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Applied a total of 0 rules in 33 ms. Remains 909 /909 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 19:40:18] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 19:40:18] [INFO ] Computed 142 invariants in 90 ms
[2024-05-28 19:40:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 3 (OVERLAPS) 9/907 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2220 variables, and 140 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43599ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43624ms
[2024-05-28 19:41:01] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:41:01] [INFO ] Invariant cache hit.
[2024-05-28 19:41:01] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-28 19:41:01] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:41:01] [INFO ] Invariant cache hit.
[2024-05-28 19:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:41:02] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 19:41:02] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:41:02] [INFO ] Invariant cache hit.
[2024-05-28 19:41:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 3 (OVERLAPS) 9/907 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2220 variables, and 140 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/907 variables, 9/140 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
[2024-05-28 19:42:06] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 41 ms to minimize.
SMT process timed out in 63439ms, After SMT, problems are : Problem set: 78 solved, 1231 unsolved
Search for dead transitions found 78 dead transitions in 63455ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in LTL mode, iteration 1 : 909/909 places, 1237/1315 transitions.
Applied a total of 0 rules in 8 ms. Remains 909 /909 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108126 ms. Remains : 909/909 places, 1237/1315 transitions.
Support contains 909 out of 909 places after structural reductions.
[2024-05-28 19:42:06] [INFO ] Flatten gal took : 136 ms
[2024-05-28 19:42:06] [INFO ] Flatten gal took : 111 ms
[2024-05-28 19:42:07] [INFO ] Input system was already deterministic with 1237 transitions.
Reduction of identical properties reduced properties to check from 60 to 58
RANDOM walk for 40000 steps (2759 resets) in 1826 ms. (21 steps per ms) remains 16/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 167 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (98 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 10/16 properties
BEST_FIRST walk for 4004 steps (45 resets) in 54 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (24 resets) in 78 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (100 resets) in 33 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (73 resets) in 27 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (120 resets) in 54 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (68 resets) in 43 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (69 resets) in 44 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (12 resets) in 57 ms. (69 steps per ms) remains 10/10 properties
[2024-05-28 19:42:08] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 909 cols
[2024-05-28 19:42:08] [INFO ] Computed 142 invariants in 53 ms
[2024-05-28 19:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp49 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 628/902 variables, 134/134 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/902 variables, 1/135 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/902 variables, 0/135 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/908 variables, 6/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/909 variables, 1/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/909 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1233/2142 variables, 909/1051 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 1/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2142 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 1052 constraints, problems are : Problem set: 9 solved, 1 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 449/450 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 0/141 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/908 variables, 1/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1233/2141 variables, 908/1050 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2141 variables, 1/1051 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-28 19:42:11] [INFO ] Deduced a trap composed of 372 places in 449 ms of which 8 ms to minimize.
[2024-05-28 19:42:12] [INFO ] Deduced a trap composed of 366 places in 417 ms of which 7 ms to minimize.
[2024-05-28 19:42:12] [INFO ] Deduced a trap composed of 366 places in 429 ms of which 7 ms to minimize.
[2024-05-28 19:42:13] [INFO ] Deduced a trap composed of 372 places in 409 ms of which 7 ms to minimize.
[2024-05-28 19:42:13] [INFO ] Deduced a trap composed of 393 places in 401 ms of which 8 ms to minimize.
[2024-05-28 19:42:14] [INFO ] Deduced a trap composed of 384 places in 443 ms of which 7 ms to minimize.
[2024-05-28 19:42:14] [INFO ] Deduced a trap composed of 390 places in 441 ms of which 7 ms to minimize.
[2024-05-28 19:42:15] [INFO ] Deduced a trap composed of 384 places in 460 ms of which 8 ms to minimize.
[2024-05-28 19:42:15] [INFO ] Deduced a trap composed of 372 places in 429 ms of which 6 ms to minimize.
SMT process timed out in 7306ms, After SMT, problems are : Problem set: 9 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1105
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 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1103
Applied a total of 273 rules in 377 ms. Remains 770 /909 variables (removed 139) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:42:16] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:42:16] [INFO ] Computed 137 invariants in 35 ms
[2024-05-28 19:42:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:42:27] [INFO ] Deduced a trap composed of 239 places in 281 ms of which 5 ms to minimize.
[2024-05-28 19:42:28] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:42:28] [INFO ] Deduced a trap composed of 227 places in 226 ms of which 5 ms to minimize.
[2024-05-28 19:42:28] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:42:29] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 19:42:29] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 5 ms to minimize.
[2024-05-28 19:42:29] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:42:29] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:42:30] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:42:30] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:42:30] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:42:31] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 4 ms to minimize.
[2024-05-28 19:42:31] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-05-28 19:42:31] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:42:32] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:42:32] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:42:32] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:42:33] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:42:33] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 5 ms to minimize.
[2024-05-28 19:42:33] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:42:34] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:42:34] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:42:35] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 5 ms to minimize.
[2024-05-28 19:42:35] [INFO ] Deduced a trap composed of 196 places in 373 ms of which 6 ms to minimize.
[2024-05-28 19:42:36] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-05-28 19:42:36] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:42:36] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 6 ms to minimize.
[2024-05-28 19:42:37] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:42:37] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:42:37] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 6 ms to minimize.
[2024-05-28 19:42:38] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:42:38] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 9 ms to minimize.
[2024-05-28 19:42:38] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
SMT process timed out in 22676ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23074 ms. Remains : 770/909 places, 1103/1237 transitions.
RANDOM walk for 40001 steps (2085 resets) in 799 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333771 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 333771 steps, saw 101538 distinct states, run finished after 3005 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-28 19:42:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:42:42] [INFO ] Invariant cache hit.
[2024-05-28 19:42:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 19:42:43] [INFO ] Deduced a trap composed of 152 places in 364 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1997ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 50 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 46 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:42:44] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:42:44] [INFO ] Invariant cache hit.
[2024-05-28 19:42:45] [INFO ] Implicit Places using invariants in 955 ms returned []
[2024-05-28 19:42:45] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:42:45] [INFO ] Invariant cache hit.
[2024-05-28 19:42:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:42:53] [INFO ] Implicit Places using invariants and state equation in 8636 ms returned []
Implicit Place search using SMT with State Equation took 9594 ms to find 0 implicit places.
[2024-05-28 19:42:53] [INFO ] Redundant transitions in 85 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:42:53] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:42:53] [INFO ] Invariant cache hit.
[2024-05-28 19:42:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:43:07] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 6 ms to minimize.
[2024-05-28 19:43:07] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 6 ms to minimize.
[2024-05-28 19:43:07] [INFO ] Deduced a trap composed of 233 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:43:08] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-05-28 19:43:08] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:43:09] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 6 ms to minimize.
[2024-05-28 19:43:09] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:43:09] [INFO ] Deduced a trap composed of 245 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:43:10] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 6 ms to minimize.
[2024-05-28 19:43:10] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:43:10] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 5 ms to minimize.
[2024-05-28 19:43:11] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 7 ms to minimize.
[2024-05-28 19:43:11] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 19:43:11] [INFO ] Deduced a trap composed of 254 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:43:12] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 5 ms to minimize.
[2024-05-28 19:43:12] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:43:12] [INFO ] Deduced a trap composed of 242 places in 347 ms of which 5 ms to minimize.
[2024-05-28 19:43:13] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 6 ms to minimize.
[2024-05-28 19:43:13] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:43:13] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:43:14] [INFO ] Deduced a trap composed of 254 places in 315 ms of which 11 ms to minimize.
[2024-05-28 19:43:14] [INFO ] Deduced a trap composed of 245 places in 346 ms of which 5 ms to minimize.
[2024-05-28 19:43:15] [INFO ] Deduced a trap composed of 248 places in 317 ms of which 6 ms to minimize.
[2024-05-28 19:43:15] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:43:16] [INFO ] Deduced a trap composed of 251 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:43:16] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:43:16] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:43:17] [INFO ] Deduced a trap composed of 236 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:43:17] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:43:17] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:43:18] [INFO ] Deduced a trap composed of 260 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:43:18] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:43:18] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:43:19] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:43:19] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:43:19] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 6 ms to minimize.
[2024-05-28 19:43:20] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:43:20] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:43:20] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:43:21] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 2.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:43:31] [INFO ] Deduced a trap composed of 200 places in 348 ms of which 6 ms to minimize.
[2024-05-28 19:43:31] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:43:31] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:43:32] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:43:32] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 6 ms to minimize.
[2024-05-28 19:43:32] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:43:33] [INFO ] Deduced a trap composed of 200 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:43:33] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:43:33] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:43:34] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 6 ms to minimize.
[2024-05-28 19:43:34] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:43:34] [INFO ] Deduced a trap composed of 200 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:43:35] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 6 ms to minimize.
[2024-05-28 19:43:35] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:43:35] [INFO ] Deduced a trap composed of 196 places in 416 ms of which 6 ms to minimize.
[2024-05-28 19:43:36] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:43:36] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:43:36] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:43:37] [INFO ] Deduced a trap composed of 200 places in 314 ms of which 4 ms to minimize.
[2024-05-28 19:43:37] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:43:40] [INFO ] Deduced a trap composed of 249 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:43:40] [INFO ] Deduced a trap composed of 248 places in 303 ms of which 6 ms to minimize.
[2024-05-28 19:43:41] [INFO ] Deduced a trap composed of 237 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:43:41] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 5 ms to minimize.
[2024-05-28 19:43:41] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:43:42] [INFO ] Deduced a trap composed of 255 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:43:42] [INFO ] Deduced a trap composed of 237 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:43:42] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 9 ms to minimize.
[2024-05-28 19:43:42] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 5 ms to minimize.
[2024-05-28 19:43:43] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:43:43] [INFO ] Deduced a trap composed of 254 places in 244 ms of which 5 ms to minimize.
[2024-05-28 19:43:43] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:43:44] [INFO ] Deduced a trap composed of 196 places in 385 ms of which 8 ms to minimize.
[2024-05-28 19:43:45] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 6 ms to minimize.
[2024-05-28 19:43:45] [INFO ] Deduced a trap composed of 216 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:43:45] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 3 ms to minimize.
[2024-05-28 19:43:46] [INFO ] Deduced a trap composed of 196 places in 361 ms of which 6 ms to minimize.
[2024-05-28 19:43:46] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:43:46] [INFO ] Deduced a trap composed of 261 places in 353 ms of which 5 ms to minimize.
[2024-05-28 19:43:47] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62602ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72369 ms. Remains : 770/770 places, 1103/1103 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-28 19:43:56] [INFO ] Flatten gal took : 76 ms
[2024-05-28 19:43:56] [INFO ] Flatten gal took : 83 ms
[2024-05-28 19:43:57] [INFO ] Input system was already deterministic with 1237 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1174
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1108
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1108
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 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1106
Applied a total of 262 rules in 87 ms. Remains 773 /909 variables (removed 136) and now considering 1106/1237 (removed 131) transitions.
Running 1100 sub problems to find dead transitions.
[2024-05-28 19:43:57] [INFO ] Flow matrix only has 1102 transitions (discarded 4 similar events)
// Phase 1: matrix 1102 rows 773 cols
[2024-05-28 19:43:57] [INFO ] Computed 137 invariants in 28 ms
[2024-05-28 19:43:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 243 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 198 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 235 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 199 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 199 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 252 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 5 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:44:13] [INFO ] Deduced a trap composed of 198 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 249 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 240 places in 293 ms of which 4 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 244 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 199 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 199 places in 240 ms of which 5 ms to minimize.
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 199 places in 240 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:44:17] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:44:17] [INFO ] Deduced a trap composed of 200 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:44:17] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 200 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:44:19] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:44:19] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 5 ms to minimize.
[2024-05-28 19:44:19] [INFO ] Deduced a trap composed of 200 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:44:19] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 5 ms to minimize.
[2024-05-28 19:44:20] [INFO ] Deduced a trap composed of 200 places in 237 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/1875 variables, and 163 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/773 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:44:21] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 199 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 5 ms to minimize.
[2024-05-28 19:44:22] [INFO ] Deduced a trap composed of 199 places in 348 ms of which 8 ms to minimize.
[2024-05-28 19:44:23] [INFO ] Deduced a trap composed of 199 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:44:23] [INFO ] Deduced a trap composed of 199 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:44:23] [INFO ] Deduced a trap composed of 198 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 198 places in 352 ms of which 6 ms to minimize.
[2024-05-28 19:44:24] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:44:25] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:44:25] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:44:25] [INFO ] Deduced a trap composed of 199 places in 280 ms of which 4 ms to minimize.
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 199 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 199 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:44:27] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:44:27] [INFO ] Deduced a trap composed of 203 places in 307 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:44:28] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:44:28] [INFO ] Deduced a trap composed of 246 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:44:29] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:44:29] [INFO ] Deduced a trap composed of 243 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:44:30] [INFO ] Deduced a trap composed of 237 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:44:30] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 5 ms to minimize.
[2024-05-28 19:44:30] [INFO ] Deduced a trap composed of 199 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:44:31] [INFO ] Deduced a trap composed of 240 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:44:31] [INFO ] Deduced a trap composed of 250 places in 342 ms of which 5 ms to minimize.
[2024-05-28 19:44:31] [INFO ] Deduced a trap composed of 253 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:44:32] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 6 ms to minimize.
[2024-05-28 19:44:32] [INFO ] Deduced a trap composed of 231 places in 349 ms of which 6 ms to minimize.
[2024-05-28 19:44:32] [INFO ] Deduced a trap composed of 243 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:44:33] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:44:33] [INFO ] Deduced a trap composed of 243 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:44:34] [INFO ] Deduced a trap composed of 339 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:44:34] [INFO ] Deduced a trap composed of 346 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:44:34] [INFO ] Deduced a trap composed of 347 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:44:36] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 2 ms to minimize.
[2024-05-28 19:44:37] [INFO ] Deduced a trap composed of 198 places in 233 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/1875 variables, and 203 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/773 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 71/71 constraints]
After SMT, in 42792ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 42803ms
[2024-05-28 19:44:40] [INFO ] Flow matrix only has 1102 transitions (discarded 4 similar events)
[2024-05-28 19:44:40] [INFO ] Invariant cache hit.
[2024-05-28 19:44:41] [INFO ] Implicit Places using invariants in 997 ms returned []
[2024-05-28 19:44:41] [INFO ] Flow matrix only has 1102 transitions (discarded 4 similar events)
[2024-05-28 19:44:41] [INFO ] Invariant cache hit.
[2024-05-28 19:44:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:44:51] [INFO ] Implicit Places using invariants and state equation in 10519 ms returned []
Implicit Place search using SMT with State Equation took 11531 ms to find 0 implicit places.
[2024-05-28 19:44:51] [INFO ] Redundant transitions in 33 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-28 19:44:51] [INFO ] Flow matrix only has 1102 transitions (discarded 4 similar events)
[2024-05-28 19:44:51] [INFO ] Invariant cache hit.
[2024-05-28 19:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 4 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 5 ms to minimize.
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 234 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:45:08] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:45:08] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:45:08] [INFO ] Deduced a trap composed of 199 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:45:09] [INFO ] Deduced a trap composed of 199 places in 266 ms of which 5 ms to minimize.
[2024-05-28 19:45:09] [INFO ] Deduced a trap composed of 199 places in 295 ms of which 4 ms to minimize.
[2024-05-28 19:45:09] [INFO ] Deduced a trap composed of 199 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:45:10] [INFO ] Deduced a trap composed of 198 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:45:10] [INFO ] Deduced a trap composed of 199 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:45:10] [INFO ] Deduced a trap composed of 199 places in 267 ms of which 6 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 199 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:45:18] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/1875 variables, and 150 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/773 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:45:26] [INFO ] Deduced a trap composed of 198 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:45:27] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:45:27] [INFO ] Deduced a trap composed of 199 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:45:27] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:45:28] [INFO ] Deduced a trap composed of 198 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:45:28] [INFO ] Deduced a trap composed of 199 places in 332 ms of which 6 ms to minimize.
[2024-05-28 19:45:29] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 6 ms to minimize.
[2024-05-28 19:45:30] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 268 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 246 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 265 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:45:32] [INFO ] Deduced a trap composed of 252 places in 288 ms of which 6 ms to minimize.
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 247 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 240 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 202 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 6 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 198 places in 279 ms of which 3 ms to minimize.
[2024-05-28 19:45:34] [INFO ] Deduced a trap composed of 249 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:45:35] [INFO ] Deduced a trap composed of 253 places in 360 ms of which 5 ms to minimize.
[2024-05-28 19:45:35] [INFO ] Deduced a trap composed of 249 places in 321 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/768 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:45:36] [INFO ] Deduced a trap composed of 198 places in 374 ms of which 5 ms to minimize.
[2024-05-28 19:45:37] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:45:37] [INFO ] Deduced a trap composed of 198 places in 342 ms of which 5 ms to minimize.
[2024-05-28 19:45:37] [INFO ] Deduced a trap composed of 199 places in 360 ms of which 6 ms to minimize.
[2024-05-28 19:45:38] [INFO ] Deduced a trap composed of 198 places in 355 ms of which 5 ms to minimize.
[2024-05-28 19:45:38] [INFO ] Deduced a trap composed of 199 places in 349 ms of which 6 ms to minimize.
[2024-05-28 19:45:39] [INFO ] Deduced a trap composed of 199 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:45:39] [INFO ] Deduced a trap composed of 199 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:45:39] [INFO ] Deduced a trap composed of 198 places in 354 ms of which 6 ms to minimize.
[2024-05-28 19:45:40] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:45:40] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:45:40] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 6 ms to minimize.
[2024-05-28 19:45:41] [INFO ] Deduced a trap composed of 199 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:45:41] [INFO ] Deduced a trap composed of 198 places in 276 ms of which 5 ms to minimize.
[2024-05-28 19:45:41] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:45:42] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 8 ms to minimize.
[2024-05-28 19:45:42] [INFO ] Deduced a trap composed of 199 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:45:42] [INFO ] Deduced a trap composed of 198 places in 307 ms of which 6 ms to minimize.
[2024-05-28 19:45:43] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:45:43] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 199 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 6 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 7 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 199 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 198 places in 357 ms of which 13 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 199 places in 326 ms of which 5 ms to minimize.
[2024-05-28 19:45:47] [INFO ] Deduced a trap composed of 199 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:45:47] [INFO ] Deduced a trap composed of 199 places in 369 ms of which 5 ms to minimize.
[2024-05-28 19:45:48] [INFO ] Deduced a trap composed of 198 places in 350 ms of which 6 ms to minimize.
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 198 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 199 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 199 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:45:50] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 3 ms to minimize.
[2024-05-28 19:45:50] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 5 ms to minimize.
[2024-05-28 19:45:51] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:45:51] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:45:51] [INFO ] Deduced a trap composed of 199 places in 321 ms of which 6 ms to minimize.
[2024-05-28 19:45:52] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/1875 variables, and 209 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/773 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 77/77 constraints]
After SMT, in 62753ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 62764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 773/909 places, 1106/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 117233 ms. Remains : 773/909 places, 1106/1237 transitions.
[2024-05-28 19:45:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:45:54] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:45:54] [INFO ] Input system was already deterministic with 1106 transitions.
[2024-05-28 19:45:54] [INFO ] Flatten gal took : 45 ms
[2024-05-28 19:45:54] [INFO ] Flatten gal took : 45 ms
[2024-05-28 19:45:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1117641246505131072.gal : 19 ms
[2024-05-28 19:45:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4659610621535838363.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1117641246505131072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4659610621535838363.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 19:46:25] [INFO ] Flatten gal took : 81 ms
[2024-05-28 19:46:25] [INFO ] Applying decomposition
[2024-05-28 19:46:25] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph283439288304398642.txt' '-o' '/tmp/graph283439288304398642.bin' '-w' '/tmp/graph283439288304398642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph283439288304398642.bin' '-l' '-1' '-v' '-w' '/tmp/graph283439288304398642.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:46:25] [INFO ] Decomposing Gal with order
[2024-05-28 19:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:46:25] [INFO ] Removed a total of 1257 redundant transitions.
[2024-05-28 19:46:25] [INFO ] Flatten gal took : 320 ms
[2024-05-28 19:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 33 ms.
[2024-05-28 19:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2566006685103550755.gal : 17 ms
[2024-05-28 19:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8660160020102875707.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2566006685103550755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8660160020102875707.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 58 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:46:56] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:46:56] [INFO ] Computed 137 invariants in 43 ms
[2024-05-28 19:46:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 (/ 2.0 3.0))
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43079ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43098ms
[2024-05-28 19:47:39] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:47:39] [INFO ] Invariant cache hit.
[2024-05-28 19:47:40] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-28 19:47:40] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:47:40] [INFO ] Invariant cache hit.
[2024-05-28 19:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:47:46] [INFO ] Implicit Places using invariants and state equation in 6079 ms returned []
Implicit Place search using SMT with State Equation took 6994 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:47:46] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:47:46] [INFO ] Invariant cache hit.
[2024-05-28 19:47:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 7 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 63211ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63228ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113389 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 19:48:49] [INFO ] Flatten gal took : 37 ms
[2024-05-28 19:48:49] [INFO ] Flatten gal took : 38 ms
[2024-05-28 19:48:49] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-05-28 19:48:49] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:48:49] [INFO ] Flatten gal took : 35 ms
[2024-05-28 19:48:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16010123620039491708.gal : 6 ms
[2024-05-28 19:48:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8920536785810842113.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16010123620039491708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8920536785810842113.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 19:49:19] [INFO ] Flatten gal took : 74 ms
[2024-05-28 19:49:19] [INFO ] Applying decomposition
[2024-05-28 19:49:19] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17791274740211427521.txt' '-o' '/tmp/graph17791274740211427521.bin' '-w' '/tmp/graph17791274740211427521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17791274740211427521.bin' '-l' '-1' '-v' '-w' '/tmp/graph17791274740211427521.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:49:19] [INFO ] Decomposing Gal with order
[2024-05-28 19:49:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:49:20] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 19:49:20] [INFO ] Flatten gal took : 210 ms
[2024-05-28 19:49:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 66 ms.
[2024-05-28 19:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2292318696339564755.gal : 18 ms
[2024-05-28 19:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15249037229052754380.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2292318696339564755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15249037229052754380.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1235
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1174
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 126 place count 841 transition count 1172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 839 transition count 1172
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 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1170
Applied a total of 134 rules in 76 ms. Remains 837 /909 variables (removed 72) and now considering 1170/1237 (removed 67) transitions.
Running 1164 sub problems to find dead transitions.
[2024-05-28 19:49:50] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
// Phase 1: matrix 1166 rows 837 cols
[2024-05-28 19:49:50] [INFO ] Computed 137 invariants in 29 ms
[2024-05-28 19:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 831/2003 variables, and 131 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/831 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (OVERLAPS) 5/836 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 301 places in 390 ms of which 6 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 301 places in 346 ms of which 6 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 283 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 295 places in 325 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2003 variables, and 140 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 4/4 constraints]
After SMT, in 42809ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 42822ms
[2024-05-28 19:50:33] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 19:50:33] [INFO ] Invariant cache hit.
[2024-05-28 19:50:34] [INFO ] Implicit Places using invariants in 908 ms returned []
[2024-05-28 19:50:34] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 19:50:34] [INFO ] Invariant cache hit.
[2024-05-28 19:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:50:42] [INFO ] Implicit Places using invariants and state equation in 8711 ms returned []
Implicit Place search using SMT with State Equation took 9621 ms to find 0 implicit places.
[2024-05-28 19:50:42] [INFO ] Redundant transitions in 19 ms returned []
Running 1164 sub problems to find dead transitions.
[2024-05-28 19:50:43] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 19:50:43] [INFO ] Invariant cache hit.
[2024-05-28 19:50:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/831 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 (/ 2.0 3.0))
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 (/ 2.0 3.0))
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 (/ 1.0 3.0))
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 (/ 1.0 3.0))
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 4.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 9.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/836 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/2003 variables, and 136 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 19:51:21] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/831 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/831 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 4 (OVERLAPS) 5/836 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 timeout
0)
(s442 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2003 variables, and 137 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 1/1 constraints]
After SMT, in 62426ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 62439ms
Starting structural reductions in SI_CTL mode, iteration 1 : 837/909 places, 1170/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114994 ms. Remains : 837/909 places, 1170/1237 transitions.
[2024-05-28 19:51:45] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:51:45] [INFO ] Flatten gal took : 48 ms
[2024-05-28 19:51:45] [INFO ] Input system was already deterministic with 1170 transitions.
[2024-05-28 19:51:45] [INFO ] Flatten gal took : 36 ms
[2024-05-28 19:51:45] [INFO ] Flatten gal took : 40 ms
[2024-05-28 19:51:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10598846729324243506.gal : 6 ms
[2024-05-28 19:51:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4561200496446252049.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10598846729324243506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4561200496446252049.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 19:52:15] [INFO ] Flatten gal took : 78 ms
[2024-05-28 19:52:15] [INFO ] Applying decomposition
[2024-05-28 19:52:15] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10202786944755381601.txt' '-o' '/tmp/graph10202786944755381601.bin' '-w' '/tmp/graph10202786944755381601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10202786944755381601.bin' '-l' '-1' '-v' '-w' '/tmp/graph10202786944755381601.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:52:16] [INFO ] Decomposing Gal with order
[2024-05-28 19:52:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:52:16] [INFO ] Removed a total of 1501 redundant transitions.
[2024-05-28 19:52:16] [INFO ] Flatten gal took : 112 ms
[2024-05-28 19:52:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 30 ms.
[2024-05-28 19:52:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5223441034844480592.gal : 15 ms
[2024-05-28 19:52:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13503799449576080153.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5223441034844480592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13503799449576080153.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Applied a total of 5 rules in 16 ms. Remains 904 /909 variables (removed 5) and now considering 1237/1237 (removed 0) transitions.
Running 1231 sub problems to find dead transitions.
[2024-05-28 19:52:46] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 904 cols
[2024-05-28 19:52:46] [INFO ] Computed 137 invariants in 44 ms
[2024-05-28 19:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2137 variables, and 131 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-05-28 19:53:17] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2137 variables, and 132 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 43243ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 43265ms
[2024-05-28 19:53:29] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:53:29] [INFO ] Invariant cache hit.
[2024-05-28 19:53:29] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-28 19:53:29] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:53:29] [INFO ] Invariant cache hit.
[2024-05-28 19:53:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:53:31] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 1231 sub problems to find dead transitions.
[2024-05-28 19:53:31] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:53:31] [INFO ] Invariant cache hit.
[2024-05-28 19:53:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2137 variables, and 136 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-05-28 19:54:29] [INFO ] Deduced a trap composed of 137 places in 419 ms of which 6 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 903/2137 variables, and 137 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 62637ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 62663ms
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1237/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107393 ms. Remains : 904/909 places, 1237/1237 transitions.
[2024-05-28 19:54:33] [INFO ] Flatten gal took : 37 ms
[2024-05-28 19:54:33] [INFO ] Flatten gal took : 80 ms
[2024-05-28 19:54:34] [INFO ] Input system was already deterministic with 1237 transitions.
[2024-05-28 19:54:34] [INFO ] Flatten gal took : 45 ms
[2024-05-28 19:54:34] [INFO ] Flatten gal took : 42 ms
[2024-05-28 19:54:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17690161915235374578.gal : 6 ms
[2024-05-28 19:54:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3669188751796469331.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17690161915235374578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3669188751796469331.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 19:55:04] [INFO ] Flatten gal took : 80 ms
[2024-05-28 19:55:04] [INFO ] Applying decomposition
[2024-05-28 19:55:04] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17231188984432931507.txt' '-o' '/tmp/graph17231188984432931507.bin' '-w' '/tmp/graph17231188984432931507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17231188984432931507.bin' '-l' '-1' '-v' '-w' '/tmp/graph17231188984432931507.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:55:04] [INFO ] Decomposing Gal with order
[2024-05-28 19:55:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:55:04] [INFO ] Removed a total of 1501 redundant transitions.
[2024-05-28 19:55:04] [INFO ] Flatten gal took : 137 ms
[2024-05-28 19:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 11 ms.
[2024-05-28 19:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11120861821190939630.gal : 13 ms
[2024-05-28 19:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9217487088647264931.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11120861821190939630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9217487088647264931.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 29 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:55:34] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:55:35] [INFO ] Computed 137 invariants in 33 ms
[2024-05-28 19:55:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 (/ 2.0 3.0))
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 (/ 2.0 3.0))
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 (/ 2.0 3.0))
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 1.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 1.0)
(s836 0.0)
(s837 1.0)
(s838 (/ 1.0 3.0))
(s839 1.0)
(s840 1.0)
(s841 0.0)
(s842 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42978ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42999ms
[2024-05-28 19:56:17] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:56:17] [INFO ] Invariant cache hit.
[2024-05-28 19:56:18] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-28 19:56:18] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:56:18] [INFO ] Invariant cache hit.
[2024-05-28 19:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:56:26] [INFO ] Implicit Places using invariants and state equation in 8282 ms returned []
Implicit Place search using SMT with State Equation took 8879 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:56:26] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:56:26] [INFO ] Invariant cache hit.
[2024-05-28 19:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:57:24] [INFO ] Deduced a trap composed of 304 places in 384 ms of which 6 ms to minimize.
[2024-05-28 19:57:24] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62940ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62956ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114871 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 19:57:29] [INFO ] Flatten gal took : 43 ms
[2024-05-28 19:57:29] [INFO ] Flatten gal took : 53 ms
[2024-05-28 19:57:30] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-05-28 19:57:30] [INFO ] Flatten gal took : 41 ms
[2024-05-28 19:57:30] [INFO ] Flatten gal took : 40 ms
[2024-05-28 19:57:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10183711593225379992.gal : 5 ms
[2024-05-28 19:57:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7157791291729099371.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10183711593225379992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7157791291729099371.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 19:58:00] [INFO ] Flatten gal took : 83 ms
[2024-05-28 19:58:00] [INFO ] Applying decomposition
[2024-05-28 19:58:00] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12492218303773376627.txt' '-o' '/tmp/graph12492218303773376627.bin' '-w' '/tmp/graph12492218303773376627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12492218303773376627.bin' '-l' '-1' '-v' '-w' '/tmp/graph12492218303773376627.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:58:00] [INFO ] Decomposing Gal with order
[2024-05-28 19:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:58:00] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 19:58:00] [INFO ] Flatten gal took : 126 ms
[2024-05-28 19:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 18 ms.
[2024-05-28 19:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8971826597850095895.gal : 15 ms
[2024-05-28 19:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16342269841410424664.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8971826597850095895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16342269841410424664.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
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 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 95 ms. Remains 770 /909 variables (removed 139) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:58:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:58:30] [INFO ] Computed 137 invariants in 21 ms
[2024-05-28 19:58:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 239 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 233 places in 252 ms of which 5 ms to minimize.
[2024-05-28 19:58:44] [INFO ] Deduced a trap composed of 227 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:58:45] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 3 ms to minimize.
[2024-05-28 19:58:45] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:58:45] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:58:45] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:58:46] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 5 ms to minimize.
[2024-05-28 19:58:46] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:58:46] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:58:47] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:58:47] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-28 19:58:47] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 3 ms to minimize.
[2024-05-28 19:58:48] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:58:48] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:58:48] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:58:49] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:58:49] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 5 ms to minimize.
[2024-05-28 19:58:49] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:58:49] [INFO ] Deduced a trap composed of 196 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:58:50] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 19:58:50] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:58:51] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:58:51] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:58:51] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:58:52] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:58:52] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:58:52] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:58:53] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:58:53] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:58:53] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
SMT process timed out in 22991ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23008ms
[2024-05-28 19:58:53] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:58:53] [INFO ] Invariant cache hit.
[2024-05-28 19:58:54] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-28 19:58:54] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:58:54] [INFO ] Invariant cache hit.
[2024-05-28 19:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:59:00] [INFO ] Implicit Places using invariants and state equation in 5446 ms returned []
Implicit Place search using SMT with State Equation took 6362 ms to find 0 implicit places.
[2024-05-28 19:59:00] [INFO ] Redundant transitions in 24 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:59:00] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:59:00] [INFO ] Invariant cache hit.
[2024-05-28 19:59:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:59:13] [INFO ] Deduced a trap composed of 245 places in 326 ms of which 6 ms to minimize.
[2024-05-28 19:59:13] [INFO ] Deduced a trap composed of 196 places in 383 ms of which 5 ms to minimize.
[2024-05-28 19:59:14] [INFO ] Deduced a trap composed of 233 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:59:14] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:59:15] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 6 ms to minimize.
[2024-05-28 19:59:15] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:59:15] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:59:16] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:59:17] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:59:17] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 5 ms to minimize.
[2024-05-28 19:59:17] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-05-28 19:59:18] [INFO ] Deduced a trap composed of 254 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:59:18] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 5 ms to minimize.
[2024-05-28 19:59:19] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:59:20] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 5 ms to minimize.
[2024-05-28 19:59:20] [INFO ] Deduced a trap composed of 242 places in 343 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:59:21] [INFO ] Deduced a trap composed of 254 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:59:21] [INFO ] Deduced a trap composed of 245 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:59:22] [INFO ] Deduced a trap composed of 248 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:59:22] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:59:22] [INFO ] Deduced a trap composed of 251 places in 336 ms of which 7 ms to minimize.
[2024-05-28 19:59:23] [INFO ] Deduced a trap composed of 196 places in 352 ms of which 5 ms to minimize.
[2024-05-28 19:59:23] [INFO ] Deduced a trap composed of 233 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:59:24] [INFO ] Deduced a trap composed of 236 places in 362 ms of which 5 ms to minimize.
[2024-05-28 19:59:24] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:59:24] [INFO ] Deduced a trap composed of 230 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:59:25] [INFO ] Deduced a trap composed of 260 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:59:25] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:59:25] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:59:26] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:59:26] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 5 ms to minimize.
[2024-05-28 19:59:26] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:59:26] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:59:27] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:59:27] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:59:27] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:59:38] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:59:38] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 6 ms to minimize.
[2024-05-28 19:59:38] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 4 ms to minimize.
[2024-05-28 19:59:39] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:59:39] [INFO ] Deduced a trap composed of 200 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:59:39] [INFO ] Deduced a trap composed of 196 places in 384 ms of which 4 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 6 ms to minimize.
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 200 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 6 ms to minimize.
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 200 places in 342 ms of which 6 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 6 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 6 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 200 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 5 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 249 places in 329 ms of which 6 ms to minimize.
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 248 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:59:48] [INFO ] Deduced a trap composed of 237 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:59:48] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:59:48] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 255 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 248 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 5 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 5 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 254 places in 242 ms of which 5 ms to minimize.
[2024-05-28 19:59:51] [INFO ] Deduced a trap composed of 245 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:59:51] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 7 ms to minimize.
[2024-05-28 19:59:52] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 6 ms to minimize.
[2024-05-28 19:59:52] [INFO ] Deduced a trap composed of 216 places in 353 ms of which 5 ms to minimize.
[2024-05-28 19:59:52] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 5 ms to minimize.
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:59:54] [INFO ] Deduced a trap composed of 261 places in 364 ms of which 5 ms to minimize.
[2024-05-28 19:59:54] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63144ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63165ms
Starting structural reductions in SI_CTL mode, iteration 1 : 770/909 places, 1103/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92670 ms. Remains : 770/909 places, 1103/1237 transitions.
[2024-05-28 20:00:03] [INFO ] Flatten gal took : 55 ms
[2024-05-28 20:00:03] [INFO ] Flatten gal took : 48 ms
[2024-05-28 20:00:03] [INFO ] Input system was already deterministic with 1103 transitions.
RANDOM walk for 174 steps (7 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S05J60-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 20:00:03] [INFO ] Flatten gal took : 64 ms
[2024-05-28 20:00:03] [INFO ] Flatten gal took : 49 ms
[2024-05-28 20:00:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5535865431401401901.gal : 7 ms
[2024-05-28 20:00:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16902932553008784958.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5535865431401401901.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16902932553008784958.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1235
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1174
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 841 transition count 1173
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 128 place count 840 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 839 transition count 1172
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 839 transition count 1172
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 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1170
Applied a total of 134 rules in 122 ms. Remains 837 /909 variables (removed 72) and now considering 1170/1237 (removed 67) transitions.
Running 1164 sub problems to find dead transitions.
[2024-05-28 20:00:04] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
// Phase 1: matrix 1166 rows 837 cols
[2024-05-28 20:00:04] [INFO ] Computed 137 invariants in 20 ms
[2024-05-28 20:00:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 264 places in 301 ms of which 5 ms to minimize.
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 264 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 264 places in 324 ms of which 4 ms to minimize.
[2024-05-28 20:00:21] [INFO ] Deduced a trap composed of 264 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:00:21] [INFO ] Deduced a trap composed of 264 places in 315 ms of which 4 ms to minimize.
[2024-05-28 20:00:21] [INFO ] Deduced a trap composed of 408 places in 317 ms of which 4 ms to minimize.
[2024-05-28 20:00:22] [INFO ] Deduced a trap composed of 264 places in 305 ms of which 4 ms to minimize.
[2024-05-28 20:00:22] [INFO ] Deduced a trap composed of 264 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 264 places in 396 ms of which 6 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 264 places in 349 ms of which 5 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 264 places in 371 ms of which 6 ms to minimize.
[2024-05-28 20:00:24] [INFO ] Deduced a trap composed of 264 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:00:24] [INFO ] Deduced a trap composed of 264 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 264 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 264 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 264 places in 335 ms of which 4 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 264 places in 387 ms of which 6 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 264 places in 324 ms of which 4 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 264 places in 354 ms of which 5 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 264 places in 325 ms of which 5 ms to minimize.
SMT process timed out in 23491ms, After SMT, problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 23509ms
[2024-05-28 20:00:27] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 20:00:27] [INFO ] Invariant cache hit.
[2024-05-28 20:00:28] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-28 20:00:28] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 20:00:28] [INFO ] Invariant cache hit.
[2024-05-28 20:00:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:00:35] [INFO ] Implicit Places using invariants and state equation in 6916 ms returned []
Implicit Place search using SMT with State Equation took 7856 ms to find 0 implicit places.
[2024-05-28 20:00:35] [INFO ] Redundant transitions in 10 ms returned []
Running 1164 sub problems to find dead transitions.
[2024-05-28 20:00:35] [INFO ] Flow matrix only has 1166 transitions (discarded 4 similar events)
[2024-05-28 20:00:35] [INFO ] Invariant cache hit.
[2024-05-28 20:00:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:00:51] [INFO ] Deduced a trap composed of 264 places in 360 ms of which 6 ms to minimize.
[2024-05-28 20:00:51] [INFO ] Deduced a trap composed of 264 places in 325 ms of which 4 ms to minimize.
[2024-05-28 20:00:52] [INFO ] Deduced a trap composed of 264 places in 339 ms of which 6 ms to minimize.
[2024-05-28 20:00:52] [INFO ] Deduced a trap composed of 288 places in 309 ms of which 6 ms to minimize.
[2024-05-28 20:00:52] [INFO ] Deduced a trap composed of 264 places in 388 ms of which 6 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 264 places in 349 ms of which 6 ms to minimize.
[2024-05-28 20:00:53] [INFO ] Deduced a trap composed of 264 places in 323 ms of which 6 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 264 places in 383 ms of which 6 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 264 places in 334 ms of which 6 ms to minimize.
[2024-05-28 20:00:54] [INFO ] Deduced a trap composed of 264 places in 309 ms of which 5 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 264 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 264 places in 287 ms of which 5 ms to minimize.
[2024-05-28 20:00:55] [INFO ] Deduced a trap composed of 264 places in 337 ms of which 4 ms to minimize.
[2024-05-28 20:00:56] [INFO ] Deduced a trap composed of 264 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:00:56] [INFO ] Deduced a trap composed of 264 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:00:56] [INFO ] Deduced a trap composed of 264 places in 227 ms of which 4 ms to minimize.
[2024-05-28 20:00:57] [INFO ] Deduced a trap composed of 264 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:00:57] [INFO ] Deduced a trap composed of 264 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:00:57] [INFO ] Deduced a trap composed of 264 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:00:58] [INFO ] Deduced a trap composed of 287 places in 303 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:00:59] [INFO ] Deduced a trap composed of 306 places in 348 ms of which 5 ms to minimize.
[2024-05-28 20:00:59] [INFO ] Deduced a trap composed of 264 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:00:59] [INFO ] Deduced a trap composed of 264 places in 383 ms of which 6 ms to minimize.
[2024-05-28 20:01:00] [INFO ] Deduced a trap composed of 306 places in 376 ms of which 6 ms to minimize.
[2024-05-28 20:01:00] [INFO ] Deduced a trap composed of 264 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:01:01] [INFO ] Deduced a trap composed of 264 places in 366 ms of which 6 ms to minimize.
[2024-05-28 20:01:01] [INFO ] Deduced a trap composed of 309 places in 346 ms of which 6 ms to minimize.
[2024-05-28 20:01:01] [INFO ] Deduced a trap composed of 264 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:01:02] [INFO ] Deduced a trap composed of 264 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:01:02] [INFO ] Deduced a trap composed of 264 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:01:02] [INFO ] Deduced a trap composed of 264 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 264 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 264 places in 350 ms of which 6 ms to minimize.
[2024-05-28 20:01:03] [INFO ] Deduced a trap composed of 264 places in 363 ms of which 5 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 264 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:01:04] [INFO ] Deduced a trap composed of 264 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:01:05] [INFO ] Deduced a trap composed of 264 places in 379 ms of which 6 ms to minimize.
[2024-05-28 20:01:05] [INFO ] Deduced a trap composed of 264 places in 354 ms of which 5 ms to minimize.
[2024-05-28 20:01:05] [INFO ] Deduced a trap composed of 264 places in 337 ms of which 5 ms to minimize.
[2024-05-28 20:01:06] [INFO ] Deduced a trap composed of 264 places in 354 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/832 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 832/2003 variables, and 172 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:01:10] [INFO ] Deduced a trap composed of 264 places in 358 ms of which 5 ms to minimize.
[2024-05-28 20:01:11] [INFO ] Deduced a trap composed of 264 places in 354 ms of which 6 ms to minimize.
[2024-05-28 20:01:11] [INFO ] Deduced a trap composed of 264 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:01:11] [INFO ] Deduced a trap composed of 264 places in 357 ms of which 5 ms to minimize.
[2024-05-28 20:01:12] [INFO ] Deduced a trap composed of 264 places in 341 ms of which 6 ms to minimize.
[2024-05-28 20:01:12] [INFO ] Deduced a trap composed of 264 places in 362 ms of which 6 ms to minimize.
[2024-05-28 20:01:13] [INFO ] Deduced a trap composed of 292 places in 363 ms of which 5 ms to minimize.
[2024-05-28 20:01:13] [INFO ] Deduced a trap composed of 264 places in 361 ms of which 5 ms to minimize.
[2024-05-28 20:01:13] [INFO ] Deduced a trap composed of 264 places in 362 ms of which 6 ms to minimize.
[2024-05-28 20:01:14] [INFO ] Deduced a trap composed of 264 places in 354 ms of which 6 ms to minimize.
[2024-05-28 20:01:14] [INFO ] Deduced a trap composed of 264 places in 347 ms of which 6 ms to minimize.
[2024-05-28 20:01:15] [INFO ] Deduced a trap composed of 264 places in 359 ms of which 6 ms to minimize.
[2024-05-28 20:01:15] [INFO ] Deduced a trap composed of 264 places in 396 ms of which 6 ms to minimize.
[2024-05-28 20:01:16] [INFO ] Deduced a trap composed of 264 places in 404 ms of which 6 ms to minimize.
[2024-05-28 20:01:16] [INFO ] Deduced a trap composed of 264 places in 362 ms of which 5 ms to minimize.
[2024-05-28 20:01:17] [INFO ] Deduced a trap composed of 267 places in 413 ms of which 5 ms to minimize.
[2024-05-28 20:01:17] [INFO ] Deduced a trap composed of 264 places in 395 ms of which 6 ms to minimize.
[2024-05-28 20:01:18] [INFO ] Deduced a trap composed of 267 places in 396 ms of which 6 ms to minimize.
[2024-05-28 20:01:18] [INFO ] Deduced a trap composed of 264 places in 357 ms of which 6 ms to minimize.
[2024-05-28 20:01:19] [INFO ] Deduced a trap composed of 267 places in 424 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/832 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:01:21] [INFO ] Deduced a trap composed of 264 places in 413 ms of which 6 ms to minimize.
[2024-05-28 20:01:21] [INFO ] Deduced a trap composed of 267 places in 385 ms of which 6 ms to minimize.
[2024-05-28 20:01:22] [INFO ] Deduced a trap composed of 264 places in 391 ms of which 5 ms to minimize.
[2024-05-28 20:01:22] [INFO ] Deduced a trap composed of 264 places in 378 ms of which 5 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 264 places in 380 ms of which 5 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 264 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 264 places in 391 ms of which 6 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 264 places in 390 ms of which 6 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 264 places in 394 ms of which 5 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 267 places in 398 ms of which 6 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 264 places in 384 ms of which 5 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 267 places in 374 ms of which 5 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 264 places in 353 ms of which 6 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 267 places in 383 ms of which 5 ms to minimize.
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 264 places in 373 ms of which 6 ms to minimize.
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 267 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 264 places in 317 ms of which 4 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 267 places in 295 ms of which 4 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 264 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 264 places in 310 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/832 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 20:01:30] [INFO ] Deduced a trap composed of 264 places in 405 ms of which 5 ms to minimize.
[2024-05-28 20:01:31] [INFO ] Deduced a trap composed of 267 places in 409 ms of which 6 ms to minimize.
[2024-05-28 20:01:31] [INFO ] Deduced a trap composed of 263 places in 397 ms of which 6 ms to minimize.
[2024-05-28 20:01:32] [INFO ] Deduced a trap composed of 263 places in 293 ms of which 8 ms to minimize.
[2024-05-28 20:01:32] [INFO ] Deduced a trap composed of 264 places in 376 ms of which 6 ms to minimize.
[2024-05-28 20:01:32] [INFO ] Deduced a trap composed of 267 places in 318 ms of which 4 ms to minimize.
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 263 places in 372 ms of which 7 ms to minimize.
[2024-05-28 20:01:33] [INFO ] Deduced a trap composed of 263 places in 376 ms of which 5 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 267 places in 364 ms of which 5 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 263 places in 365 ms of which 5 ms to minimize.
[2024-05-28 20:01:34] [INFO ] Deduced a trap composed of 263 places in 322 ms of which 4 ms to minimize.
[2024-05-28 20:01:35] [INFO ] Deduced a trap composed of 267 places in 364 ms of which 6 ms to minimize.
[2024-05-28 20:01:35] [INFO ] Deduced a trap composed of 321 places in 358 ms of which 6 ms to minimize.
[2024-05-28 20:01:36] [INFO ] Deduced a trap composed of 267 places in 356 ms of which 6 ms to minimize.
[2024-05-28 20:01:36] [INFO ] Deduced a trap composed of 267 places in 353 ms of which 6 ms to minimize.
[2024-05-28 20:01:36] [INFO ] Deduced a trap composed of 264 places in 344 ms of which 6 ms to minimize.
[2024-05-28 20:01:37] [INFO ] Deduced a trap composed of 267 places in 365 ms of which 6 ms to minimize.
[2024-05-28 20:01:37] [INFO ] Deduced a trap composed of 264 places in 397 ms of which 7 ms to minimize.
[2024-05-28 20:01:38] [INFO ] Deduced a trap composed of 267 places in 421 ms of which 6 ms to minimize.
[2024-05-28 20:01:38] [INFO ] Deduced a trap composed of 267 places in 392 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/832 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/2003 variables, and 232 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 100/100 constraints]
After SMT, in 63183ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 63197ms
Starting structural reductions in SI_CTL mode, iteration 1 : 837/909 places, 1170/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94711 ms. Remains : 837/909 places, 1170/1237 transitions.
[2024-05-28 20:01:38] [INFO ] Flatten gal took : 58 ms
[2024-05-28 20:01:38] [INFO ] Flatten gal took : 53 ms
[2024-05-28 20:01:38] [INFO ] Input system was already deterministic with 1170 transitions.
[2024-05-28 20:01:38] [INFO ] Flatten gal took : 48 ms
[2024-05-28 20:01:38] [INFO ] Flatten gal took : 55 ms
[2024-05-28 20:01:38] [INFO ] Time to serialize gal into /tmp/CTLFireability17397886515093779933.gal : 8 ms
[2024-05-28 20:01:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17376476128015333917.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17397886515093779933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17376476128015333917.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:02:09] [INFO ] Flatten gal took : 50 ms
[2024-05-28 20:02:09] [INFO ] Applying decomposition
[2024-05-28 20:02:09] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph754513824867229615.txt' '-o' '/tmp/graph754513824867229615.bin' '-w' '/tmp/graph754513824867229615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph754513824867229615.bin' '-l' '-1' '-v' '-w' '/tmp/graph754513824867229615.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:02:09] [INFO ] Decomposing Gal with order
[2024-05-28 20:02:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:02:09] [INFO ] Removed a total of 1320 redundant transitions.
[2024-05-28 20:02:09] [INFO ] Flatten gal took : 194 ms
[2024-05-28 20:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 29 ms.
[2024-05-28 20:02:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4805442148143764967.gal : 14 ms
[2024-05-28 20:02:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15034721274815314382.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4805442148143764967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15034721274815314382.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1173
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1108
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1107
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1107
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 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 176 ms. Remains 772 /909 variables (removed 137) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:02:39] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 20:02:39] [INFO ] Computed 137 invariants in 29 ms
[2024-05-28 20:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:02:53] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:02:53] [INFO ] Deduced a trap composed of 238 places in 316 ms of which 5 ms to minimize.
[2024-05-28 20:02:53] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:02:54] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:02:54] [INFO ] Deduced a trap composed of 198 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:02:55] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 5 ms to minimize.
[2024-05-28 20:02:55] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 5 ms to minimize.
[2024-05-28 20:02:55] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 5 ms to minimize.
[2024-05-28 20:02:56] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 5 ms to minimize.
[2024-05-28 20:02:56] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 5 ms to minimize.
[2024-05-28 20:02:56] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:02:56] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:02:57] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:02:57] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:02:57] [INFO ] Deduced a trap composed of 250 places in 278 ms of which 4 ms to minimize.
[2024-05-28 20:02:58] [INFO ] Deduced a trap composed of 241 places in 218 ms of which 4 ms to minimize.
[2024-05-28 20:02:58] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 20:02:58] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 5 ms to minimize.
[2024-05-28 20:02:59] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:02:59] [INFO ] Deduced a trap composed of 198 places in 299 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 152 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:03:04] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 6 ms to minimize.
[2024-05-28 20:03:04] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 198 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 198 places in 291 ms of which 5 ms to minimize.
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:03:07] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:03:07] [INFO ] Deduced a trap composed of 198 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 198 places in 337 ms of which 5 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 20:03:09] [INFO ] Deduced a trap composed of 198 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:03:09] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 6 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 5 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 230 places in 319 ms of which 5 ms to minimize.
[2024-05-28 20:03:11] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 5 ms to minimize.
[2024-05-28 20:03:11] [INFO ] Deduced a trap composed of 198 places in 323 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:03:12] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 198 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 4 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 5 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 198 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:03:16] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 5 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 5 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 198 places in 304 ms of which 7 ms to minimize.
[2024-05-28 20:03:21] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 5 ms to minimize.
[2024-05-28 20:03:21] [INFO ] Deduced a trap composed of 198 places in 280 ms of which 5 ms to minimize.
[2024-05-28 20:03:21] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:03:22] [INFO ] Deduced a trap composed of 198 places in 337 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 192 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 60/60 constraints]
After SMT, in 43146ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 43162ms
[2024-05-28 20:03:23] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:03:23] [INFO ] Invariant cache hit.
[2024-05-28 20:03:23] [INFO ] Implicit Places using invariants in 890 ms returned []
[2024-05-28 20:03:23] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:03:23] [INFO ] Invariant cache hit.
[2024-05-28 20:03:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:03:32] [INFO ] Implicit Places using invariants and state equation in 8252 ms returned []
Implicit Place search using SMT with State Equation took 9145 ms to find 0 implicit places.
[2024-05-28 20:03:32] [INFO ] Redundant transitions in 7 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:03:32] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:03:32] [INFO ] Invariant cache hit.
[2024-05-28 20:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 235 places in 210 ms of which 4 ms to minimize.
[2024-05-28 20:03:45] [INFO ] Deduced a trap composed of 198 places in 211 ms of which 3 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 247 places in 221 ms of which 4 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 250 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:03:46] [INFO ] Deduced a trap composed of 198 places in 215 ms of which 4 ms to minimize.
[2024-05-28 20:03:47] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 20:03:47] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:03:47] [INFO ] Deduced a trap composed of 198 places in 213 ms of which 3 ms to minimize.
[2024-05-28 20:03:48] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:03:48] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
[2024-05-28 20:03:48] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:03:48] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:03:49] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 4 ms to minimize.
[2024-05-28 20:03:50] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:03:50] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:03:50] [INFO ] Deduced a trap composed of 198 places in 227 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:03:58] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 (/ 2.0 3.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 (/ 1.0 3.0))
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 (/ 1.0 3.0))
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 (/ 2.0 3.0))
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 153 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:04:08] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-28 20:04:09] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:04:09] [INFO ] Deduced a trap composed of 198 places in 357 ms of which 5 ms to minimize.
[2024-05-28 20:04:09] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 4 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 202 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 262 places in 245 ms of which 3 ms to minimize.
[2024-05-28 20:04:10] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 3 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 202 places in 372 ms of which 6 ms to minimize.
[2024-05-28 20:04:11] [INFO ] Deduced a trap composed of 198 places in 361 ms of which 5 ms to minimize.
[2024-05-28 20:04:12] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 3 ms to minimize.
[2024-05-28 20:04:12] [INFO ] Deduced a trap composed of 198 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:04:12] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:04:12] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 3 ms to minimize.
[2024-05-28 20:04:13] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:04:13] [INFO ] Deduced a trap composed of 238 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:04:13] [INFO ] Deduced a trap composed of 247 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:04:14] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 4 ms to minimize.
[2024-05-28 20:04:14] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:04:15] [INFO ] Deduced a trap composed of 198 places in 339 ms of which 5 ms to minimize.
[2024-05-28 20:04:15] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 4 ms to minimize.
[2024-05-28 20:04:16] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:04:16] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:04:17] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:04:17] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 5 ms to minimize.
[2024-05-28 20:04:17] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 5 ms to minimize.
[2024-05-28 20:04:18] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 5 ms to minimize.
[2024-05-28 20:04:18] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:04:18] [INFO ] Deduced a trap composed of 198 places in 340 ms of which 5 ms to minimize.
[2024-05-28 20:04:18] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 3 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 4 ms to minimize.
[2024-05-28 20:04:19] [INFO ] Deduced a trap composed of 198 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 198 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 198 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:04:20] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:04:21] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:04:21] [INFO ] Deduced a trap composed of 202 places in 219 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 198 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 198 places in 213 ms of which 4 ms to minimize.
[2024-05-28 20:04:23] [INFO ] Deduced a trap composed of 198 places in 214 ms of which 4 ms to minimize.
[2024-05-28 20:04:24] [INFO ] Deduced a trap composed of 198 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:04:24] [INFO ] Deduced a trap composed of 198 places in 213 ms of which 4 ms to minimize.
[2024-05-28 20:04:27] [INFO ] Deduced a trap composed of 202 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:04:27] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 253 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 202 places in 290 ms of which 5 ms to minimize.
[2024-05-28 20:04:28] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 7 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 198 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 198 places in 234 ms of which 3 ms to minimize.
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 198 places in 243 ms of which 4 ms to minimize.
[2024-05-28 20:04:30] [INFO ] Deduced a trap composed of 198 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:04:30] [INFO ] Deduced a trap composed of 198 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:04:30] [INFO ] Deduced a trap composed of 198 places in 341 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:04:32] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 3 ms to minimize.
[2024-05-28 20:04:32] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:04:33] [INFO ] Deduced a trap composed of 198 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:04:33] [INFO ] Deduced a trap composed of 198 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:04:33] [INFO ] Deduced a trap composed of 198 places in 336 ms of which 5 ms to minimize.
[2024-05-28 20:04:34] [INFO ] Deduced a trap composed of 198 places in 348 ms of which 5 ms to minimize.
[2024-05-28 20:04:34] [INFO ] Deduced a trap composed of 198 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:04:35] [INFO ] Deduced a trap composed of 198 places in 404 ms of which 5 ms to minimize.
SMT process timed out in 62959ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 62972ms
Starting structural reductions in SI_CTL mode, iteration 1 : 772/909 places, 1105/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115478 ms. Remains : 772/909 places, 1105/1237 transitions.
[2024-05-28 20:04:35] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:04:35] [INFO ] Flatten gal took : 36 ms
[2024-05-28 20:04:35] [INFO ] Input system was already deterministic with 1105 transitions.
[2024-05-28 20:04:35] [INFO ] Flatten gal took : 33 ms
[2024-05-28 20:04:35] [INFO ] Flatten gal took : 34 ms
[2024-05-28 20:04:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4899062462149884715.gal : 5 ms
[2024-05-28 20:04:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1310348089599654091.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4899062462149884715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1310348089599654091.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:05:05] [INFO ] Flatten gal took : 73 ms
[2024-05-28 20:05:05] [INFO ] Applying decomposition
[2024-05-28 20:05:05] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6704985500162856309.txt' '-o' '/tmp/graph6704985500162856309.bin' '-w' '/tmp/graph6704985500162856309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6704985500162856309.bin' '-l' '-1' '-v' '-w' '/tmp/graph6704985500162856309.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:05:05] [INFO ] Decomposing Gal with order
[2024-05-28 20:05:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:05:05] [INFO ] Removed a total of 1288 redundant transitions.
[2024-05-28 20:05:05] [INFO ] Flatten gal took : 113 ms
[2024-05-28 20:05:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 13 ms.
[2024-05-28 20:05:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14319389474065391579.gal : 11 ms
[2024-05-28 20:05:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13726709428014841993.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14319389474065391579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13726709428014841993.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 37 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:05:36] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 20:05:36] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 20:05:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43203ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43223ms
[2024-05-28 20:06:19] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:06:19] [INFO ] Invariant cache hit.
[2024-05-28 20:06:19] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 20:06:20] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:06:20] [INFO ] Invariant cache hit.
[2024-05-28 20:06:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:06:25] [INFO ] Implicit Places using invariants and state equation in 5936 ms returned []
Implicit Place search using SMT with State Equation took 6611 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:06:25] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:06:25] [INFO ] Invariant cache hit.
[2024-05-28 20:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
(s870 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.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 0.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 0.0)
(s764 0.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:07:27] [INFO ] Deduced a trap composed of 304 places in 407 ms of which 6 ms to minimize.
[2024-05-28 20:07:27] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 63512ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63539ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113426 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 20:07:29] [INFO ] Flatten gal took : 36 ms
[2024-05-28 20:07:29] [INFO ] Flatten gal took : 39 ms
[2024-05-28 20:07:29] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-05-28 20:07:29] [INFO ] Flatten gal took : 37 ms
[2024-05-28 20:07:29] [INFO ] Flatten gal took : 36 ms
[2024-05-28 20:07:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13225769635817043121.gal : 11 ms
[2024-05-28 20:07:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12053586755538722755.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13225769635817043121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12053586755538722755.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:07:59] [INFO ] Flatten gal took : 74 ms
[2024-05-28 20:07:59] [INFO ] Applying decomposition
[2024-05-28 20:07:59] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8771609095202261078.txt' '-o' '/tmp/graph8771609095202261078.bin' '-w' '/tmp/graph8771609095202261078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8771609095202261078.bin' '-l' '-1' '-v' '-w' '/tmp/graph8771609095202261078.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:08:00] [INFO ] Decomposing Gal with order
[2024-05-28 20:08:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:08:00] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 20:08:00] [INFO ] Flatten gal took : 173 ms
[2024-05-28 20:08:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 24 ms.
[2024-05-28 20:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1931125473096436591.gal : 13 ms
[2024-05-28 20:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability18247881241734132150.ctl : 4 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1931125473096436591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18247881241734132150.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 54 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:08:30] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:08:30] [INFO ] Invariant cache hit.
[2024-05-28 20:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43425ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43446ms
[2024-05-28 20:09:14] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:14] [INFO ] Invariant cache hit.
[2024-05-28 20:09:14] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-28 20:09:14] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:14] [INFO ] Invariant cache hit.
[2024-05-28 20:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:09:21] [INFO ] Implicit Places using invariants and state equation in 6533 ms returned []
Implicit Place search using SMT with State Equation took 7237 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:09:21] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:21] [INFO ] Invariant cache hit.
[2024-05-28 20:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:10:20] [INFO ] Deduced a trap composed of 304 places in 398 ms of which 6 ms to minimize.
[2024-05-28 20:10:20] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62789ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62799ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113546 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 20:10:24] [INFO ] Flatten gal took : 30 ms
[2024-05-28 20:10:24] [INFO ] Flatten gal took : 34 ms
[2024-05-28 20:10:24] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-05-28 20:10:24] [INFO ] Flatten gal took : 33 ms
[2024-05-28 20:10:24] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:10:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12305454436298128065.gal : 5 ms
[2024-05-28 20:10:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1126973708003117499.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12305454436298128065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1126973708003117499.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:10:54] [INFO ] Flatten gal took : 33 ms
[2024-05-28 20:10:54] [INFO ] Applying decomposition
[2024-05-28 20:10:54] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6615185218853500273.txt' '-o' '/tmp/graph6615185218853500273.bin' '-w' '/tmp/graph6615185218853500273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6615185218853500273.bin' '-l' '-1' '-v' '-w' '/tmp/graph6615185218853500273.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:10:54] [INFO ] Decomposing Gal with order
[2024-05-28 20:10:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:10:54] [INFO ] Removed a total of 1501 redundant transitions.
[2024-05-28 20:10:54] [INFO ] Flatten gal took : 87 ms
[2024-05-28 20:10:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 7 ms.
[2024-05-28 20:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3142102986714035685.gal : 9 ms
[2024-05-28 20:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9967177777012210802.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3142102986714035685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9967177777012210802.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 130 place count 839 transition count 1109
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 256 place count 776 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 257 place count 775 transition count 1108
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 775 transition count 1108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 260 place count 774 transition count 1107
Applied a total of 260 rules in 62 ms. Remains 774 /909 variables (removed 135) and now considering 1107/1237 (removed 130) transitions.
Running 1101 sub problems to find dead transitions.
[2024-05-28 20:11:24] [INFO ] Flow matrix only has 1103 transitions (discarded 4 similar events)
// Phase 1: matrix 1103 rows 774 cols
[2024-05-28 20:11:24] [INFO ] Computed 137 invariants in 35 ms
[2024-05-28 20:11:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:11:37] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:11:37] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 7 ms to minimize.
[2024-05-28 20:11:37] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 5 ms to minimize.
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 5 ms to minimize.
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 254 places in 267 ms of which 3 ms to minimize.
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:11:38] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 200 places in 316 ms of which 5 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 200 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 200 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 200 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 5 ms to minimize.
[2024-05-28 20:11:40] [INFO ] Deduced a trap composed of 200 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 200 places in 317 ms of which 6 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:11:41] [INFO ] Deduced a trap composed of 200 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 200 places in 320 ms of which 5 ms to minimize.
[2024-05-28 20:11:42] [INFO ] Deduced a trap composed of 200 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:11:43] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:11:43] [INFO ] Deduced a trap composed of 200 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:11:44] [INFO ] Deduced a trap composed of 200 places in 298 ms of which 5 ms to minimize.
[2024-05-28 20:11:44] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
[2024-05-28 20:11:44] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:11:45] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:11:45] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:11:45] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:11:46] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:11:46] [INFO ] Deduced a trap composed of 200 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:11:46] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:11:46] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:11:47] [INFO ] Deduced a trap composed of 200 places in 215 ms of which 4 ms to minimize.
[2024-05-28 20:11:47] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 4 ms to minimize.
[2024-05-28 20:11:47] [INFO ] Deduced a trap composed of 200 places in 238 ms of which 4 ms to minimize.
SMT process timed out in 22955ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 22967ms
[2024-05-28 20:11:47] [INFO ] Flow matrix only has 1103 transitions (discarded 4 similar events)
[2024-05-28 20:11:47] [INFO ] Invariant cache hit.
[2024-05-28 20:11:48] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-28 20:11:48] [INFO ] Flow matrix only has 1103 transitions (discarded 4 similar events)
[2024-05-28 20:11:48] [INFO ] Invariant cache hit.
[2024-05-28 20:11:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:11:53] [INFO ] Implicit Places using invariants and state equation in 5282 ms returned []
Implicit Place search using SMT with State Equation took 6017 ms to find 0 implicit places.
[2024-05-28 20:11:53] [INFO ] Redundant transitions in 22 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-28 20:11:53] [INFO ] Flow matrix only has 1103 transitions (discarded 4 similar events)
[2024-05-28 20:11:53] [INFO ] Invariant cache hit.
[2024-05-28 20:11:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:12:07] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:12:07] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 5 ms to minimize.
[2024-05-28 20:12:07] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:12:08] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 200 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 200 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:12:10] [INFO ] Deduced a trap composed of 200 places in 229 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 12/144 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:12:20] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:12:20] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:12:20] [INFO ] Deduced a trap composed of 200 places in 211 ms of which 4 ms to minimize.
[2024-05-28 20:12:21] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:12:21] [INFO ] Deduced a trap composed of 200 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:12:21] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:12:22] [INFO ] Deduced a trap composed of 200 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:12:22] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:12:22] [INFO ] Deduced a trap composed of 200 places in 318 ms of which 7 ms to minimize.
[2024-05-28 20:12:23] [INFO ] Deduced a trap composed of 200 places in 301 ms of which 6 ms to minimize.
[2024-05-28 20:12:23] [INFO ] Deduced a trap composed of 200 places in 294 ms of which 5 ms to minimize.
[2024-05-28 20:12:23] [INFO ] Deduced a trap composed of 200 places in 281 ms of which 3 ms to minimize.
[2024-05-28 20:12:24] [INFO ] Deduced a trap composed of 200 places in 349 ms of which 6 ms to minimize.
[2024-05-28 20:12:24] [INFO ] Deduced a trap composed of 200 places in 268 ms of which 3 ms to minimize.
[2024-05-28 20:12:24] [INFO ] Deduced a trap composed of 200 places in 318 ms of which 8 ms to minimize.
[2024-05-28 20:12:25] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:12:25] [INFO ] Deduced a trap composed of 200 places in 287 ms of which 5 ms to minimize.
[2024-05-28 20:12:25] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:12:26] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:12:26] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/769 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1877 variables, and 164 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/769 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/769 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/769 variables, 32/164 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:12:28] [INFO ] Deduced a trap composed of 255 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:12:29] [INFO ] Deduced a trap composed of 246 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:12:29] [INFO ] Deduced a trap composed of 245 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:12:29] [INFO ] Deduced a trap composed of 238 places in 305 ms of which 4 ms to minimize.
[2024-05-28 20:12:30] [INFO ] Deduced a trap composed of 252 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:12:30] [INFO ] Deduced a trap composed of 243 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:12:30] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 4 ms to minimize.
[2024-05-28 20:12:31] [INFO ] Deduced a trap composed of 222 places in 370 ms of which 5 ms to minimize.
[2024-05-28 20:12:31] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 240 places in 345 ms of which 7 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 254 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 241 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 236 places in 327 ms of which 5 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 257 places in 357 ms of which 5 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 247 places in 339 ms of which 5 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 248 places in 365 ms of which 5 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 246 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 231 places in 285 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/769 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-28 20:12:44] [INFO ] Deduced a trap composed of 254 places in 293 ms of which 5 ms to minimize.
[2024-05-28 20:12:44] [INFO ] Deduced a trap composed of 242 places in 389 ms of which 5 ms to minimize.
[2024-05-28 20:12:45] [INFO ] Deduced a trap composed of 297 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:12:45] [INFO ] Deduced a trap composed of 349 places in 333 ms of which 5 ms to minimize.
[2024-05-28 20:12:45] [INFO ] Deduced a trap composed of 344 places in 307 ms of which 6 ms to minimize.
[2024-05-28 20:12:50] [INFO ] Deduced a trap composed of 301 places in 279 ms of which 5 ms to minimize.
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 164 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1877 variables, and 193 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/774 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 61/61 constraints]
After SMT, in 63199ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 63221ms
Starting structural reductions in SI_CTL mode, iteration 1 : 774/909 places, 1107/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 92307 ms. Remains : 774/909 places, 1107/1237 transitions.
[2024-05-28 20:12:57] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:12:57] [INFO ] Flatten gal took : 47 ms
[2024-05-28 20:12:57] [INFO ] Input system was already deterministic with 1107 transitions.
[2024-05-28 20:12:57] [INFO ] Flatten gal took : 45 ms
[2024-05-28 20:12:57] [INFO ] Flatten gal took : 46 ms
[2024-05-28 20:12:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2041061382121077417.gal : 7 ms
[2024-05-28 20:12:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9372181293287847720.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2041061382121077417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9372181293287847720.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:13:27] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:13:27] [INFO ] Applying decomposition
[2024-05-28 20:13:27] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph4209496209555344070.txt' '-o' '/tmp/graph4209496209555344070.bin' '-w' '/tmp/graph4209496209555344070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4209496209555344070.bin' '-l' '-1' '-v' '-w' '/tmp/graph4209496209555344070.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:13:27] [INFO ] Decomposing Gal with order
[2024-05-28 20:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:13:27] [INFO ] Removed a total of 1258 redundant transitions.
[2024-05-28 20:13:27] [INFO ] Flatten gal took : 101 ms
[2024-05-28 20:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 8 ms.
[2024-05-28 20:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16273666338637138829.gal : 10 ms
[2024-05-28 20:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15641205844581430942.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16273666338637138829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15641205844581430942.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 2 place count 903 transition count 1175
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 124 place count 842 transition count 1175
Applied a total of 124 rules in 106 ms. Remains 842 /909 variables (removed 67) and now considering 1175/1237 (removed 62) transitions.
Running 1169 sub problems to find dead transitions.
[2024-05-28 20:13:57] [INFO ] Flow matrix only has 1171 transitions (discarded 4 similar events)
// Phase 1: matrix 1171 rows 842 cols
[2024-05-28 20:13:58] [INFO ] Computed 137 invariants in 31 ms
[2024-05-28 20:13:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 (/ 2.0 3.0))
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 (/ 2.0 3.0))
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 (/ 2.0 3.0))
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 (/ 2.0 3.0))
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 (/ 2.0 3.0))
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 (/ 2.0 3.0))
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 4.0)
(s701 0.0)
(s702 0.0)
(s703 0.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 timeout
(/ 1.0 3.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/2013 variables, and 131 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1169/1169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
[2024-05-28 20:14:28] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/836 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2013 variables, and 132 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1169 constraints, Known Traps: 1/1 constraints]
After SMT, in 43050ms problems are : Problem set: 0 solved, 1169 unsolved
Search for dead transitions found 0 dead transitions in 43074ms
[2024-05-28 20:14:41] [INFO ] Flow matrix only has 1171 transitions (discarded 4 similar events)
[2024-05-28 20:14:41] [INFO ] Invariant cache hit.
[2024-05-28 20:14:41] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-28 20:14:41] [INFO ] Flow matrix only has 1171 transitions (discarded 4 similar events)
[2024-05-28 20:14:41] [INFO ] Invariant cache hit.
[2024-05-28 20:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:14:49] [INFO ] Implicit Places using invariants and state equation in 7900 ms returned []
Implicit Place search using SMT with State Equation took 8461 ms to find 0 implicit places.
[2024-05-28 20:14:49] [INFO ] Redundant transitions in 28 ms returned []
Running 1169 sub problems to find dead transitions.
[2024-05-28 20:14:49] [INFO ] Flow matrix only has 1171 transitions (discarded 4 similar events)
[2024-05-28 20:14:49] [INFO ] Invariant cache hit.
[2024-05-28 20:14:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/836 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 3 (OVERLAPS) 5/841 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 841/2013 variables, and 136 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1169/1169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/836 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/836 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
[2024-05-28 20:15:29] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/836 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/2013 variables, and 132 constraints, problems are : Problem set: 0 solved, 1169 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/842 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1169 constraints, Known Traps: 1/1 constraints]
After SMT, in 63269ms problems are : Problem set: 0 solved, 1169 unsolved
Search for dead transitions found 0 dead transitions in 63292ms
Starting structural reductions in SI_CTL mode, iteration 1 : 842/909 places, 1175/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114988 ms. Remains : 842/909 places, 1175/1237 transitions.
[2024-05-28 20:15:52] [INFO ] Flatten gal took : 52 ms
[2024-05-28 20:15:52] [INFO ] Flatten gal took : 53 ms
[2024-05-28 20:15:53] [INFO ] Input system was already deterministic with 1175 transitions.
[2024-05-28 20:15:53] [INFO ] Flatten gal took : 53 ms
[2024-05-28 20:15:53] [INFO ] Flatten gal took : 54 ms
[2024-05-28 20:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7906982528893271975.gal : 9 ms
[2024-05-28 20:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17154559316770806299.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7906982528893271975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17154559316770806299.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:16:23] [INFO ] Flatten gal took : 87 ms
[2024-05-28 20:16:23] [INFO ] Applying decomposition
[2024-05-28 20:16:23] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17938283435629035599.txt' '-o' '/tmp/graph17938283435629035599.bin' '-w' '/tmp/graph17938283435629035599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17938283435629035599.bin' '-l' '-1' '-v' '-w' '/tmp/graph17938283435629035599.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:16:23] [INFO ] Decomposing Gal with order
[2024-05-28 20:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:16:23] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 20:16:23] [INFO ] Flatten gal took : 124 ms
[2024-05-28 20:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 16 ms.
[2024-05-28 20:16:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3287934518205400518.gal : 15 ms
[2024-05-28 20:16:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2218628061535266163.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3287934518205400518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2218628061535266163.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 909 transition count 1234
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 906 transition count 1233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 905 transition count 1233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 905 transition count 1232
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 10 place count 904 transition count 1232
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 12 place count 903 transition count 1231
Applied a total of 12 rules in 48 ms. Remains 903 /909 variables (removed 6) and now considering 1231/1237 (removed 6) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-28 20:16:53] [INFO ] Flow matrix only has 1227 transitions (discarded 4 similar events)
// Phase 1: matrix 1227 rows 903 cols
[2024-05-28 20:16:53] [INFO ] Computed 142 invariants in 24 ms
[2024-05-28 20:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/2130 variables, and 131 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-28 20:17:24] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/2130 variables, and 132 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 126/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 42660ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 42672ms
[2024-05-28 20:17:36] [INFO ] Flow matrix only has 1227 transitions (discarded 4 similar events)
[2024-05-28 20:17:36] [INFO ] Invariant cache hit.
[2024-05-28 20:17:37] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-28 20:17:37] [INFO ] Flow matrix only has 1227 transitions (discarded 4 similar events)
[2024-05-28 20:17:37] [INFO ] Invariant cache hit.
[2024-05-28 20:17:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:17:42] [INFO ] Implicit Places using invariants and state equation in 4969 ms returned []
Implicit Place search using SMT with State Equation took 5598 ms to find 0 implicit places.
[2024-05-28 20:17:42] [INFO ] Redundant transitions in 19 ms returned []
Running 1225 sub problems to find dead transitions.
[2024-05-28 20:17:42] [INFO ] Flow matrix only has 1227 transitions (discarded 4 similar events)
[2024-05-28 20:17:42] [INFO ] Invariant cache hit.
[2024-05-28 20:17:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 9/901 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 901/2130 variables, and 140 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 9/901 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-28 20:18:42] [INFO ] Deduced a trap composed of 372 places in 418 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/2130 variables, and 141 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 62453ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 62471ms
Starting structural reductions in SI_CTL mode, iteration 1 : 903/909 places, 1231/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110825 ms. Remains : 903/909 places, 1231/1237 transitions.
[2024-05-28 20:18:44] [INFO ] Flatten gal took : 35 ms
[2024-05-28 20:18:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 20:18:44] [INFO ] Input system was already deterministic with 1231 transitions.
[2024-05-28 20:18:44] [INFO ] Flatten gal took : 39 ms
[2024-05-28 20:18:44] [INFO ] Flatten gal took : 38 ms
[2024-05-28 20:18:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7288485999517463353.gal : 7 ms
[2024-05-28 20:18:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11916517753056356945.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7288485999517463353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11916517753056356945.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:19:15] [INFO ] Flatten gal took : 36 ms
[2024-05-28 20:19:15] [INFO ] Applying decomposition
[2024-05-28 20:19:15] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15863123838426336157.txt' '-o' '/tmp/graph15863123838426336157.bin' '-w' '/tmp/graph15863123838426336157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15863123838426336157.bin' '-l' '-1' '-v' '-w' '/tmp/graph15863123838426336157.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:19:15] [INFO ] Decomposing Gal with order
[2024-05-28 20:19:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:19:15] [INFO ] Removed a total of 1619 redundant transitions.
[2024-05-28 20:19:15] [INFO ] Flatten gal took : 120 ms
[2024-05-28 20:19:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 15 ms.
[2024-05-28 20:19:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9186355201267462341.gal : 11 ms
[2024-05-28 20:19:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14958163785576443435.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9186355201267462341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14958163785576443435.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1172
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1107
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1106
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 71 ms. Remains 772 /909 variables (removed 137) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:19:45] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 20:19:45] [INFO ] Computed 137 invariants in 40 ms
[2024-05-28 20:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 238 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 198 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 235 places in 265 ms of which 5 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 238 places in 302 ms of which 4 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 198 places in 337 ms of which 6 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 5 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 244 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 198 places in 323 ms of which 5 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 198 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 198 places in 229 ms of which 3 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 198 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 198 places in 335 ms of which 5 ms to minimize.
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 4 ms to minimize.
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 4 ms to minimize.
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 198 places in 212 ms of which 4 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 198 places in 223 ms of which 4 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 198 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 198 places in 220 ms of which 3 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 198 places in 218 ms of which 3 ms to minimize.
[2024-05-28 20:20:08] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:20:08] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:20:08] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
SMT process timed out in 23154ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 23166ms
[2024-05-28 20:20:08] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:20:08] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-28 20:20:09] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:20:15] [INFO ] Implicit Places using invariants and state equation in 5733 ms returned []
Implicit Place search using SMT with State Equation took 6482 ms to find 0 implicit places.
[2024-05-28 20:20:15] [INFO ] Redundant transitions in 24 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:20:15] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:20:15] [INFO ] Invariant cache hit.
[2024-05-28 20:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:20:29] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 5 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 198 places in 341 ms of which 6 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 198 places in 324 ms of which 6 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 198 places in 287 ms of which 5 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 198 places in 268 ms of which 5 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 198 places in 335 ms of which 5 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 6 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 198 places in 323 ms of which 5 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 198 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 198 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 198 places in 308 ms of which 4 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 198 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 198 places in 372 ms of which 5 ms to minimize.
[2024-05-28 20:20:35] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:20:35] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
[2024-05-28 20:20:35] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:20:36] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:20:37] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:20:37] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:20:37] [INFO ] Deduced a trap composed of 198 places in 345 ms of which 6 ms to minimize.
[2024-05-28 20:20:38] [INFO ] Deduced a trap composed of 198 places in 354 ms of which 4 ms to minimize.
[2024-05-28 20:20:38] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 20:20:38] [INFO ] Deduced a trap composed of 198 places in 283 ms of which 6 ms to minimize.
[2024-05-28 20:20:39] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:20:39] [INFO ] Deduced a trap composed of 198 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:20:39] [INFO ] Deduced a trap composed of 198 places in 302 ms of which 4 ms to minimize.
[2024-05-28 20:20:40] [INFO ] Deduced a trap composed of 198 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:20:40] [INFO ] Deduced a trap composed of 198 places in 309 ms of which 5 ms to minimize.
[2024-05-28 20:20:41] [INFO ] Deduced a trap composed of 198 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:20:41] [INFO ] Deduced a trap composed of 198 places in 301 ms of which 5 ms to minimize.
[2024-05-28 20:20:41] [INFO ] Deduced a trap composed of 198 places in 298 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1873 variables, and 167 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 35/167 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:20:50] [INFO ] Deduced a trap composed of 198 places in 333 ms of which 5 ms to minimize.
[2024-05-28 20:20:50] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:20:51] [INFO ] Deduced a trap composed of 198 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:20:51] [INFO ] Deduced a trap composed of 198 places in 337 ms of which 5 ms to minimize.
[2024-05-28 20:20:51] [INFO ] Deduced a trap composed of 198 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:20:52] [INFO ] Deduced a trap composed of 198 places in 284 ms of which 4 ms to minimize.
[2024-05-28 20:20:52] [INFO ] Deduced a trap composed of 198 places in 313 ms of which 5 ms to minimize.
[2024-05-28 20:20:52] [INFO ] Deduced a trap composed of 250 places in 284 ms of which 5 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 198 places in 295 ms of which 4 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 4 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 198 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 5 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 198 places in 330 ms of which 5 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 198 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 198 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 198 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 202 places in 352 ms of which 6 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 198 places in 319 ms of which 5 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 198 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:20:57] [INFO ] Deduced a trap composed of 202 places in 331 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 5 ms to minimize.
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 5 ms to minimize.
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 202 places in 323 ms of which 5 ms to minimize.
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 198 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 202 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 6 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 198 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 202 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 202 places in 273 ms of which 5 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 202 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 198 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 5 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 198 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 198 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 198 places in 248 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 20/207 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
[2024-05-28 20:21:05] [INFO ] Deduced a trap composed of 245 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:21:06] [INFO ] Deduced a trap composed of 229 places in 300 ms of which 5 ms to minimize.
[2024-05-28 20:21:06] [INFO ] Deduced a trap composed of 239 places in 314 ms of which 5 ms to minimize.
[2024-05-28 20:21:06] [INFO ] Deduced a trap composed of 229 places in 298 ms of which 5 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 254 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:21:07] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:21:09] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 20:21:12] [INFO ] Deduced a trap composed of 343 places in 293 ms of which 3 ms to minimize.
[2024-05-28 20:21:12] [INFO ] Deduced a trap composed of 349 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:21:13] [INFO ] Deduced a trap composed of 238 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:21:13] [INFO ] Deduced a trap composed of 202 places in 400 ms of which 5 ms to minimize.
[2024-05-28 20:21:14] [INFO ] Deduced a trap composed of 202 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:21:14] [INFO ] Deduced a trap composed of 198 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:21:15] [INFO ] Deduced a trap composed of 202 places in 365 ms of which 5 ms to minimize.
[2024-05-28 20:21:15] [INFO ] Deduced a trap composed of 202 places in 267 ms of which 3 ms to minimize.
[2024-05-28 20:21:16] [INFO ] Deduced a trap composed of 202 places in 366 ms of which 4 ms to minimize.
[2024-05-28 20:21:16] [INFO ] Deduced a trap composed of 202 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:21:16] [INFO ] Deduced a trap composed of 198 places in 320 ms of which 6 ms to minimize.
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 198 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1873 variables, and 227 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 95/95 constraints]
After SMT, in 63276ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 63300ms
Starting structural reductions in SI_CTL mode, iteration 1 : 772/909 places, 1105/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93060 ms. Remains : 772/909 places, 1105/1237 transitions.
[2024-05-28 20:21:18] [INFO ] Flatten gal took : 53 ms
[2024-05-28 20:21:18] [INFO ] Flatten gal took : 49 ms
[2024-05-28 20:21:18] [INFO ] Input system was already deterministic with 1105 transitions.
[2024-05-28 20:21:18] [INFO ] Flatten gal took : 52 ms
[2024-05-28 20:21:18] [INFO ] Flatten gal took : 49 ms
[2024-05-28 20:21:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9181949571476844864.gal : 8 ms
[2024-05-28 20:21:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7546549112579249925.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9181949571476844864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7546549112579249925.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:21:49] [INFO ] Flatten gal took : 69 ms
[2024-05-28 20:21:49] [INFO ] Applying decomposition
[2024-05-28 20:21:49] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2035819431281652215.txt' '-o' '/tmp/graph2035819431281652215.bin' '-w' '/tmp/graph2035819431281652215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2035819431281652215.bin' '-l' '-1' '-v' '-w' '/tmp/graph2035819431281652215.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:21:49] [INFO ] Decomposing Gal with order
[2024-05-28 20:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:21:49] [INFO ] Removed a total of 1261 redundant transitions.
[2024-05-28 20:21:49] [INFO ] Flatten gal took : 97 ms
[2024-05-28 20:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 10 ms.
[2024-05-28 20:21:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10836662951091210938.gal : 10 ms
[2024-05-28 20:21:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5975349585495471915.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10836662951091210938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5975349585495471915.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1236
Applied a total of 7 rules in 21 ms. Remains 903 /909 variables (removed 6) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:22:19] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 20:22:19] [INFO ] Computed 137 invariants in 39 ms
[2024-05-28 20:22:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43145ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43156ms
[2024-05-28 20:23:02] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:23:02] [INFO ] Invariant cache hit.
[2024-05-28 20:23:03] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-28 20:23:03] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:23:03] [INFO ] Invariant cache hit.
[2024-05-28 20:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:23:06] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:23:06] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:23:06] [INFO ] Invariant cache hit.
[2024-05-28 20:23:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:24:04] [INFO ] Deduced a trap composed of 304 places in 380 ms of which 6 ms to minimize.
[2024-05-28 20:24:04] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62619ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62632ms
Starting structural reductions in LTL mode, iteration 1 : 903/909 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109197 ms. Remains : 903/909 places, 1236/1237 transitions.
[2024-05-28 20:24:08] [INFO ] Flatten gal took : 39 ms
[2024-05-28 20:24:08] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:24:08] [INFO ] Input system was already deterministic with 1236 transitions.
[2024-05-28 20:24:08] [INFO ] Flatten gal took : 41 ms
[2024-05-28 20:24:08] [INFO ] Flatten gal took : 40 ms
[2024-05-28 20:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10070303586788112146.gal : 7 ms
[2024-05-28 20:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16634400378300723185.ctl : 12 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10070303586788112146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16634400378300723185.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:24:39] [INFO ] Flatten gal took : 63 ms
[2024-05-28 20:24:39] [INFO ] Applying decomposition
[2024-05-28 20:24:39] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3801068886912915892.txt' '-o' '/tmp/graph3801068886912915892.bin' '-w' '/tmp/graph3801068886912915892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3801068886912915892.bin' '-l' '-1' '-v' '-w' '/tmp/graph3801068886912915892.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:24:39] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:39] [INFO ] Removed a total of 1329 redundant transitions.
[2024-05-28 20:24:39] [INFO ] Flatten gal took : 191 ms
[2024-05-28 20:24:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 19 ms.
[2024-05-28 20:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9743076604196946033.gal : 13 ms
[2024-05-28 20:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5584597769588378123.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9743076604196946033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5584597769588378123.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 909/909 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 909 transition count 1176
Reduce places removed 61 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 63 rules applied. Total rules applied 124 place count 848 transition count 1174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 846 transition count 1174
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 126 place count 846 transition count 1110
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 254 place count 782 transition count 1110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 781 transition count 1109
Applied a total of 256 rules in 93 ms. Remains 781 /909 variables (removed 128) and now considering 1109/1237 (removed 128) transitions.
Running 1103 sub problems to find dead transitions.
[2024-05-28 20:25:09] [INFO ] Flow matrix only has 1105 transitions (discarded 4 similar events)
// Phase 1: matrix 1105 rows 781 cols
[2024-05-28 20:25:09] [INFO ] Computed 142 invariants in 20 ms
[2024-05-28 20:25:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 201 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 202 places in 315 ms of which 5 ms to minimize.
[2024-05-28 20:25:23] [INFO ] Deduced a trap composed of 201 places in 282 ms of which 5 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 250 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:25:24] [INFO ] Deduced a trap composed of 242 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 250 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 244 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:25:25] [INFO ] Deduced a trap composed of 254 places in 344 ms of which 6 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 202 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:25:26] [INFO ] Deduced a trap composed of 201 places in 281 ms of which 3 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 235 places in 234 ms of which 3 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 201 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 201 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 201 places in 315 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 201 places in 284 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 201 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 201 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 201 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 201 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:25:30] [INFO ] Deduced a trap composed of 225 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:25:30] [INFO ] Deduced a trap composed of 221 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 221 places in 283 ms of which 3 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 6 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 227 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 6 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 5 ms to minimize.
SMT process timed out in 22940ms, After SMT, problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 22955ms
[2024-05-28 20:25:32] [INFO ] Flow matrix only has 1105 transitions (discarded 4 similar events)
[2024-05-28 20:25:32] [INFO ] Invariant cache hit.
[2024-05-28 20:25:33] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-05-28 20:25:33] [INFO ] Flow matrix only has 1105 transitions (discarded 4 similar events)
[2024-05-28 20:25:33] [INFO ] Invariant cache hit.
[2024-05-28 20:25:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:25:38] [INFO ] Implicit Places using invariants and state equation in 4501 ms returned []
Implicit Place search using SMT with State Equation took 5453 ms to find 0 implicit places.
[2024-05-28 20:25:38] [INFO ] Redundant transitions in 12 ms returned []
Running 1103 sub problems to find dead transitions.
[2024-05-28 20:25:38] [INFO ] Flow matrix only has 1105 transitions (discarded 4 similar events)
[2024-05-28 20:25:38] [INFO ] Invariant cache hit.
[2024-05-28 20:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 202 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 201 places in 303 ms of which 3 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 201 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 201 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 201 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:25:54] [INFO ] Deduced a trap composed of 201 places in 243 ms of which 4 ms to minimize.
[2024-05-28 20:25:54] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:25:54] [INFO ] Deduced a trap composed of 202 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:25:55] [INFO ] Deduced a trap composed of 202 places in 333 ms of which 5 ms to minimize.
[2024-05-28 20:25:55] [INFO ] Deduced a trap composed of 202 places in 384 ms of which 5 ms to minimize.
[2024-05-28 20:25:55] [INFO ] Deduced a trap composed of 202 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 202 places in 294 ms of which 5 ms to minimize.
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 201 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 201 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 202 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 201 places in 288 ms of which 5 ms to minimize.
[2024-05-28 20:25:58] [INFO ] Deduced a trap composed of 201 places in 312 ms of which 3 ms to minimize.
[2024-05-28 20:25:58] [INFO ] Deduced a trap composed of 201 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:25:58] [INFO ] Deduced a trap composed of 201 places in 304 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:25:59] [INFO ] Deduced a trap composed of 202 places in 330 ms of which 5 ms to minimize.
[2024-05-28 20:25:59] [INFO ] Deduced a trap composed of 202 places in 319 ms of which 5 ms to minimize.
[2024-05-28 20:26:00] [INFO ] Deduced a trap composed of 201 places in 284 ms of which 4 ms to minimize.
[2024-05-28 20:26:00] [INFO ] Deduced a trap composed of 201 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:26:01] [INFO ] Deduced a trap composed of 202 places in 276 ms of which 5 ms to minimize.
[2024-05-28 20:26:01] [INFO ] Deduced a trap composed of 202 places in 271 ms of which 5 ms to minimize.
[2024-05-28 20:26:01] [INFO ] Deduced a trap composed of 201 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:26:02] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 5 ms to minimize.
[2024-05-28 20:26:02] [INFO ] Deduced a trap composed of 201 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:26:02] [INFO ] Deduced a trap composed of 201 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:26:03] [INFO ] Deduced a trap composed of 201 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:26:03] [INFO ] Deduced a trap composed of 201 places in 353 ms of which 5 ms to minimize.
[2024-05-28 20:26:03] [INFO ] Deduced a trap composed of 201 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 201 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 201 places in 335 ms of which 5 ms to minimize.
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 202 places in 290 ms of which 5 ms to minimize.
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 201 places in 283 ms of which 4 ms to minimize.
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:26:05] [INFO ] Deduced a trap composed of 201 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:26:06] [INFO ] Deduced a trap composed of 202 places in 346 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 3.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 (/ 1.0 3.0))
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 (/ 1.0 3.0))
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 (/ 3.0 4.0))
(s381 0.0)
(s382 4.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 9.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/1886 variables, and 172 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/134 constraints, Generalized P Invariants (flows): 6/8 constraints, State Equation: 0/781 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1103/1103 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/771 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:26:13] [INFO ] Deduced a trap composed of 206 places in 369 ms of which 6 ms to minimize.
[2024-05-28 20:26:14] [INFO ] Deduced a trap composed of 202 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:26:14] [INFO ] Deduced a trap composed of 202 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:26:15] [INFO ] Deduced a trap composed of 204 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:26:15] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:26:15] [INFO ] Deduced a trap composed of 201 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:26:15] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:26:16] [INFO ] Deduced a trap composed of 206 places in 220 ms of which 3 ms to minimize.
[2024-05-28 20:26:16] [INFO ] Deduced a trap composed of 202 places in 315 ms of which 6 ms to minimize.
[2024-05-28 20:26:16] [INFO ] Deduced a trap composed of 202 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:26:16] [INFO ] Deduced a trap composed of 202 places in 229 ms of which 3 ms to minimize.
[2024-05-28 20:26:17] [INFO ] Deduced a trap composed of 202 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:26:17] [INFO ] Deduced a trap composed of 206 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:26:17] [INFO ] Deduced a trap composed of 202 places in 303 ms of which 6 ms to minimize.
[2024-05-28 20:26:18] [INFO ] Deduced a trap composed of 202 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:26:18] [INFO ] Deduced a trap composed of 202 places in 219 ms of which 4 ms to minimize.
[2024-05-28 20:26:18] [INFO ] Deduced a trap composed of 202 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:26:19] [INFO ] Deduced a trap composed of 201 places in 232 ms of which 8 ms to minimize.
[2024-05-28 20:26:19] [INFO ] Deduced a trap composed of 203 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:26:19] [INFO ] Deduced a trap composed of 202 places in 346 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:26:21] [INFO ] Deduced a trap composed of 202 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:26:21] [INFO ] Deduced a trap composed of 202 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:26:21] [INFO ] Deduced a trap composed of 202 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:26:22] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:26:22] [INFO ] Deduced a trap composed of 201 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:26:22] [INFO ] Deduced a trap composed of 201 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:26:23] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:26:23] [INFO ] Deduced a trap composed of 201 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:26:23] [INFO ] Deduced a trap composed of 201 places in 227 ms of which 4 ms to minimize.
[2024-05-28 20:26:23] [INFO ] Deduced a trap composed of 201 places in 240 ms of which 3 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 3 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 201 places in 222 ms of which 3 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 201 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 201 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 201 places in 219 ms of which 4 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 201 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 201 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 201 places in 227 ms of which 3 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 201 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 201 places in 228 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:26:28] [INFO ] Deduced a trap composed of 206 places in 316 ms of which 5 ms to minimize.
[2024-05-28 20:26:28] [INFO ] Deduced a trap composed of 202 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:26:28] [INFO ] Deduced a trap composed of 202 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:26:29] [INFO ] Deduced a trap composed of 202 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:26:29] [INFO ] Deduced a trap composed of 204 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:26:29] [INFO ] Deduced a trap composed of 205 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:26:30] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 5 ms to minimize.
[2024-05-28 20:26:30] [INFO ] Deduced a trap composed of 206 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:26:30] [INFO ] Deduced a trap composed of 202 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:26:30] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:26:31] [INFO ] Deduced a trap composed of 202 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:26:31] [INFO ] Deduced a trap composed of 206 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:26:31] [INFO ] Deduced a trap composed of 202 places in 320 ms of which 5 ms to minimize.
[2024-05-28 20:26:32] [INFO ] Deduced a trap composed of 206 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:26:32] [INFO ] Deduced a trap composed of 202 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:26:32] [INFO ] Deduced a trap composed of 206 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:26:33] [INFO ] Deduced a trap composed of 202 places in 281 ms of which 5 ms to minimize.
[2024-05-28 20:26:33] [INFO ] Deduced a trap composed of 202 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:26:33] [INFO ] Deduced a trap composed of 202 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:26:34] [INFO ] Deduced a trap composed of 205 places in 335 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-28 20:26:37] [INFO ] Deduced a trap composed of 206 places in 357 ms of which 6 ms to minimize.
[2024-05-28 20:26:37] [INFO ] Deduced a trap composed of 202 places in 339 ms of which 5 ms to minimize.
[2024-05-28 20:26:37] [INFO ] Deduced a trap composed of 206 places in 306 ms of which 5 ms to minimize.
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 202 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 202 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 206 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 201 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 201 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:26:40] [INFO ] Deduced a trap composed of 201 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:26:40] [INFO ] Deduced a trap composed of 202 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:26:41] [INFO ] Deduced a trap composed of 202 places in 308 ms of which 5 ms to minimize.
SMT process timed out in 63177ms, After SMT, problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 63192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 781/909 places, 1109/1237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91719 ms. Remains : 781/909 places, 1109/1237 transitions.
[2024-05-28 20:26:41] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:26:41] [INFO ] Flatten gal took : 46 ms
[2024-05-28 20:26:41] [INFO ] Input system was already deterministic with 1109 transitions.
[2024-05-28 20:26:41] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:26:41] [INFO ] Flatten gal took : 77 ms
[2024-05-28 20:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9689670463962021498.gal : 10 ms
[2024-05-28 20:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3216724603959721281.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9689670463962021498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3216724603959721281.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:27:11] [INFO ] Flatten gal took : 71 ms
[2024-05-28 20:27:11] [INFO ] Applying decomposition
[2024-05-28 20:27:11] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17862728533635770754.txt' '-o' '/tmp/graph17862728533635770754.bin' '-w' '/tmp/graph17862728533635770754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17862728533635770754.bin' '-l' '-1' '-v' '-w' '/tmp/graph17862728533635770754.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:27:12] [INFO ] Decomposing Gal with order
[2024-05-28 20:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:27:12] [INFO ] Removed a total of 1768 redundant transitions.
[2024-05-28 20:27:12] [INFO ] Flatten gal took : 118 ms
[2024-05-28 20:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 211 labels/synchronizations in 14 ms.
[2024-05-28 20:27:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11645043242923156281.gal : 10 ms
[2024-05-28 20:27:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10910135566160385760.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11645043242923156281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10910135566160385760.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-28 20:27:42] [INFO ] Flatten gal took : 68 ms
[2024-05-28 20:27:42] [INFO ] Flatten gal took : 65 ms
[2024-05-28 20:27:42] [INFO ] Applying decomposition
[2024-05-28 20:27:43] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1670868104025425334.txt' '-o' '/tmp/graph1670868104025425334.bin' '-w' '/tmp/graph1670868104025425334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1670868104025425334.bin' '-l' '-1' '-v' '-w' '/tmp/graph1670868104025425334.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:27:43] [INFO ] Decomposing Gal with order
[2024-05-28 20:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:27:43] [INFO ] Removed a total of 1799 redundant transitions.
[2024-05-28 20:27:43] [INFO ] Flatten gal took : 115 ms
[2024-05-28 20:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 8 ms.
[2024-05-28 20:27:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9215710100592726529.gal : 10 ms
[2024-05-28 20:27:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4883461180815703191.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9215710100592726529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4883461180815703191.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 20:37:42] [INFO ] Applying decomposition
[2024-05-28 20:37:42] [INFO ] Flatten gal took : 65 ms
[2024-05-28 20:37:42] [INFO ] Decomposing Gal with order
[2024-05-28 20:37:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:37:42] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[Schedule_Task_E_42],[Schedule_Task_E_43],[Schedule_Task_E_44],[Schedule_Task_E_45],[Schedule_Task_E_46],[Schedule_Task_E_47],[Schedule_Task_E_48],[Schedule_Task_E_49],[Schedule_Task_E_50],[Schedule_Task_E_51],[Schedule_Task_E_52],[Schedule_Task_E_53],[Schedule_Task_E_54],[Schedule_Task_E_55],[Schedule_Task_E_56],[Schedule_Task_E_57],[Schedule_Task_E_58],[Schedule_Task_E_59],[Schedule_Task_E_60],[Schedule_Task_E_61],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41, Perform_Work_B_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42, Perform_Work_B_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43, Perform_Work_B_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44, Perform_Work_B_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45, Perform_Work_B_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46, Perform_Work_B_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47, Perform_Work_B_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48, Perform_Work_B_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49, Perform_Work_B_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50, Perform_Work_B_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51, Perform_Work_B_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52, Perform_Work_B_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53, Perform_Work_B_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54, Perform_Work_B_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55, Perform_Work_B_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56, Perform_Work_B_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57, Perform_Work_B_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58, Perform_Work_B_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59, Perform_Work_B_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60, Perform_Work_B_60],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 20:37:42] [INFO ] Flatten gal took : 66 ms
[2024-05-28 20:37:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8368770168335011770.gal : 8 ms
[2024-05-28 20:37:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1906218823680106408.ctl : 9 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8368770168335011770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1906218823680106408.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBNT-COL-S05J60"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J60, 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 r290-tajo-171654447000386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;