About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2686816.00 | 0.00 | 0.00 | ???????F?????F?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079600082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m040, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079600082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 23:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716796921228
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 08:02:02] [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-27 08:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:02:02] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2024-05-27 08:02:02] [INFO ] Transformed 6690 places.
[2024-05-27 08:02:02] [INFO ] Transformed 11934 transitions.
[2024-05-27 08:02:02] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 4305 places in 41 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 57 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1069 places :
Symmetric choice reduction at 1 with 1069 rule applications. Total rules 1188 place count 1299 transition count 10081
Iterating global reduction 1 with 1069 rules applied. Total rules applied 2257 place count 1299 transition count 10081
Ensure Unique test removed 414 transitions
Reduce isomorphic transitions removed 414 transitions.
Iterating post reduction 1 with 414 rules applied. Total rules applied 2671 place count 1299 transition count 9667
Discarding 833 places :
Symmetric choice reduction at 2 with 833 rule applications. Total rules 3504 place count 466 transition count 8834
Iterating global reduction 2 with 833 rules applied. Total rules applied 4337 place count 466 transition count 8834
Ensure Unique test removed 6537 transitions
Reduce isomorphic transitions removed 6537 transitions.
Iterating post reduction 2 with 6537 rules applied. Total rules applied 10874 place count 466 transition count 2297
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 10895 place count 445 transition count 2276
Iterating global reduction 3 with 21 rules applied. Total rules applied 10916 place count 445 transition count 2276
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 11002 place count 445 transition count 2190
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 11008 place count 439 transition count 2184
Iterating global reduction 4 with 6 rules applied. Total rules applied 11014 place count 439 transition count 2184
Applied a total of 11014 rules in 444 ms. Remains 439 /2385 variables (removed 1946) and now considering 2184/11934 (removed 9750) transitions.
// Phase 1: matrix 2184 rows 439 cols
[2024-05-27 08:02:03] [INFO ] Computed 3 invariants in 49 ms
[2024-05-27 08:02:04] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-27 08:02:04] [INFO ] Invariant cache hit.
[2024-05-27 08:02:04] [INFO ] State equation strengthened by 1788 read => feed constraints.
[2024-05-27 08:02:08] [INFO ] Implicit Places using invariants and state equation in 4159 ms returned []
Implicit Place search using SMT with State Equation took 4646 ms to find 0 implicit places.
Running 2183 sub problems to find dead transitions.
[2024-05-27 08:02:08] [INFO ] Invariant cache hit.
[2024-05-27 08:02:08] [INFO ] State equation strengthened by 1788 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/2623 variables, and 3 constraints, problems are : Problem set: 0 solved, 2183 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/439 constraints, ReadFeed: 0/1788 constraints, PredecessorRefiner: 2183/2183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/2623 variables, and 3 constraints, problems are : Problem set: 0 solved, 2183 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/439 constraints, ReadFeed: 0/1788 constraints, PredecessorRefiner: 0/2183 constraints, Known Traps: 0/0 constraints]
After SMT, in 71445ms problems are : Problem set: 0 solved, 2183 unsolved
Search for dead transitions found 0 dead transitions in 71485ms
Starting structural reductions in LTL mode, iteration 1 : 439/2385 places, 2184/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76615 ms. Remains : 439/2385 places, 2184/11934 transitions.
Support contains 57 out of 439 places after structural reductions.
[2024-05-27 08:03:20] [INFO ] Flatten gal took : 141 ms
[2024-05-27 08:03:20] [INFO ] Flatten gal took : 100 ms
[2024-05-27 08:03:20] [INFO ] Input system was already deterministic with 2184 transitions.
Support contains 56 out of 439 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 56 to 54
RANDOM walk for 40000 steps (6764 resets) in 4669 ms. (8 steps per ms) remains 10/54 properties
BEST_FIRST walk for 40004 steps (656 resets) in 282 ms. (141 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (312 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (702 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (628 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (623 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (672 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (325 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (603 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (606 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (647 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
[2024-05-27 08:03:22] [INFO ] Invariant cache hit.
[2024-05-27 08:03:22] [INFO ] State equation strengthened by 1788 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 109/129 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/136 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 45/181 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1091/1272 variables, 181/184 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 695/879 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1272 variables, 0/879 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 10 (OVERLAPS) 1351/2623 variables, 258/1137 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2623 variables, 1093/2230 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2623 variables, 0/2230 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2623 variables, 0/2230 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2623/2623 variables, and 2230 constraints, problems are : Problem set: 8 solved, 2 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 439/439 constraints, ReadFeed: 1788/1788 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/114 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/121 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/168 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 486/654 variables, 168/171 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 90/261 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/261 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1969/2623 variables, 271/532 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2623 variables, 1698/2230 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2623 variables, 2/2232 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2623 variables, 0/2232 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/2623 variables, 0/2232 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2623/2623 variables, and 2232 constraints, problems are : Problem set: 8 solved, 2 unsolved in 2437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 439/439 constraints, ReadFeed: 1788/1788 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 4155ms problems are : Problem set: 8 solved, 2 unsolved
Parikh walk visited 1 properties in 520 ms.
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2184/2184 transitions.
Graph (complete) has 2976 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 438 transition count 2175
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 60 place count 388 transition count 646
Iterating global reduction 1 with 50 rules applied. Total rules applied 110 place count 388 transition count 646
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 121 place count 388 transition count 635
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 217 place count 292 transition count 539
Iterating global reduction 2 with 96 rules applied. Total rules applied 313 place count 292 transition count 539
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 382 place count 292 transition count 470
Discarding 112 places :
Symmetric choice reduction at 3 with 112 rule applications. Total rules 494 place count 180 transition count 358
Iterating global reduction 3 with 112 rules applied. Total rules applied 606 place count 180 transition count 358
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 92 rules applied. Total rules applied 698 place count 180 transition count 266
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 701 place count 177 transition count 227
Iterating global reduction 4 with 3 rules applied. Total rules applied 704 place count 177 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 706 place count 175 transition count 225
Iterating global reduction 4 with 2 rules applied. Total rules applied 708 place count 175 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 709 place count 175 transition count 224
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 713 place count 171 transition count 220
Iterating global reduction 5 with 4 rules applied. Total rules applied 717 place count 171 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 721 place count 171 transition count 216
Applied a total of 721 rules in 100 ms. Remains 171 /439 variables (removed 268) and now considering 216/2184 (removed 1968) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 171/439 places, 216/2184 transitions.
RANDOM walk for 40000 steps (8384 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1475 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2074523 steps, run timeout after 3001 ms. (steps per millisecond=691 ) properties seen :0 out of 1
Probabilistic random walk after 2074523 steps, saw 914555 distinct states, run finished after 3004 ms. (steps per millisecond=690 ) properties seen :0
// Phase 1: matrix 216 rows 171 cols
[2024-05-27 08:03:30] [INFO ] Computed 4 invariants in 6 ms
[2024-05-27 08:03:30] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 199/333 variables, 134/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 36/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/383 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 17/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/387 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 53/53 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 199/333 variables, 134/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 36/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/383 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 17/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/387 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 08:03:30] [INFO ] Deduced a trap composed of 99 places in 65 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 171 /171 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 171/171 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-27 08:03:30] [INFO ] Invariant cache hit.
[2024-05-27 08:03:30] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 08:03:30] [INFO ] Invariant cache hit.
[2024-05-27 08:03:30] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 08:03:31] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-27 08:03:31] [INFO ] Redundant transitions in 9 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-27 08:03:31] [INFO ] Invariant cache hit.
[2024-05-27 08:03:31] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-27 08:03:32] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-27 08:03:33] [INFO ] Deduced a trap composed of 66 places in 35 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-27 08:03:33] [INFO ] Deduced a trap composed of 66 places in 33 ms of which 0 ms to minimize.
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
[2024-05-27 08:03:33] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 203 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 4 (OVERLAPS) 216/387 variables, 171/179 constraints. Problems are: Problem set: 36 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 53/232 constraints. Problems are: Problem set: 36 solved, 179 unsolved
[2024-05-27 08:03:35] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/233 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-05-27 08:03:37] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-27 08:03:38] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 2/235 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-05-27 08:03:38] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/236 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/236 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/236 constraints. Problems are: Problem set: 46 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 236 constraints, problems are : Problem set: 46 solved, 169 unsolved in 12527 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 46 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 43/171 variables, 4/4 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 8/12 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-05-27 08:03:44] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 2 ms to minimize.
[2024-05-27 08:03:44] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/14 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/14 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 216/387 variables, 171/185 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 53/238 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 169/407 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/407 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/387 variables, 0/407 constraints. Problems are: Problem set: 46 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 407 constraints, problems are : Problem set: 46 solved, 169 unsolved in 14270 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 169/215 constraints, Known Traps: 10/10 constraints]
After SMT, in 27135ms problems are : Problem set: 46 solved, 169 unsolved
Search for dead transitions found 46 dead transitions in 27138ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 171/171 places, 170/216 transitions.
Graph (complete) has 434 edges and 171 vertex of which 129 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 127 transition count 152
Applied a total of 21 rules in 18 ms. Remains 127 /171 variables (removed 44) and now considering 152/170 (removed 18) transitions.
// Phase 1: matrix 152 rows 127 cols
[2024-05-27 08:03:58] [INFO ] Computed 1 invariants in 3 ms
[2024-05-27 08:03:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-27 08:03:58] [INFO ] Invariant cache hit.
[2024-05-27 08:03:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-27 08:03:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 127/171 places, 152/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27891 ms. Remains : 127/171 places, 152/216 transitions.
RANDOM walk for 40000 steps (8428 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1580 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2546339 steps, run timeout after 3001 ms. (steps per millisecond=848 ) properties seen :0 out of 1
Probabilistic random walk after 2546339 steps, saw 1095130 distinct states, run finished after 3001 ms. (steps per millisecond=848 ) properties seen :0
[2024-05-27 08:04:01] [INFO ] Invariant cache hit.
[2024-05-27 08:04:01] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 161/271 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 44/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/279 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 161/271 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 44/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/279 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/279 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 152/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-27 08:04:01] [INFO ] Invariant cache hit.
[2024-05-27 08:04:01] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 08:04:01] [INFO ] Invariant cache hit.
[2024-05-27 08:04:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-27 08:04:02] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-27 08:04:02] [INFO ] Redundant transitions in 6 ms returned []
Running 151 sub problems to find dead transitions.
[2024-05-27 08:04:02] [INFO ] Invariant cache hit.
[2024-05-27 08:04:02] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/279 variables, 127/128 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/279 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 173 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/279 variables, 127/128 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 151/324 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/279 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 324 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
After SMT, in 11632ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 11633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11897 ms. Remains : 127/127 places, 152/152 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 127 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 123 transition count 147
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 9 place count 123 transition count 121
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 61 place count 97 transition count 121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 92 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 91 transition count 122
Applied a total of 73 rules in 25 ms. Remains 91 /127 variables (removed 36) and now considering 122/152 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 91 cols
[2024-05-27 08:04:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:04:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 08:04:13] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 08:04:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 08:04:13] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 08:04:13] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 08:04:13] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m040-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 08:04:14] [INFO ] Flatten gal took : 65 ms
[2024-05-27 08:04:14] [INFO ] Flatten gal took : 82 ms
[2024-05-27 08:04:14] [INFO ] Input system was already deterministic with 2184 transitions.
Computed a total of 151 stabilizing places and 1130 stable transitions
Graph (complete) has 3067 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 2184/2184 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 763
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 763
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 110 place count 392 transition count 747
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 202 place count 300 transition count 655
Iterating global reduction 1 with 92 rules applied. Total rules applied 294 place count 300 transition count 655
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 393 place count 300 transition count 556
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 497 place count 196 transition count 452
Iterating global reduction 2 with 104 rules applied. Total rules applied 601 place count 196 transition count 452
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 725 place count 196 transition count 328
Applied a total of 725 rules in 18 ms. Remains 196 /439 variables (removed 243) and now considering 328/2184 (removed 1856) transitions.
// Phase 1: matrix 328 rows 196 cols
[2024-05-27 08:04:14] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:04:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 08:04:14] [INFO ] Invariant cache hit.
[2024-05-27 08:04:14] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-27 08:04:14] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2024-05-27 08:04:14] [INFO ] Invariant cache hit.
[2024-05-27 08:04:14] [INFO ] State equation strengthened by 145 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 4 (OVERLAPS) 328/524 variables, 196/199 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 145/344 constraints. Problems are: Problem set: 24 solved, 303 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/344 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/344 constraints. Problems are: Problem set: 24 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 344 constraints, problems are : Problem set: 24 solved, 303 unsolved in 12134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 17/188 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 3 (OVERLAPS) 8/196 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 5 (OVERLAPS) 328/524 variables, 196/199 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 145/344 constraints. Problems are: Problem set: 24 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 303/647 constraints. Problems are: Problem set: 24 solved, 303 unsolved
[2024-05-27 08:04:36] [INFO ] Deduced a trap composed of 101 places in 72 ms of which 5 ms to minimize.
[2024-05-27 08:04:36] [INFO ] Deduced a trap composed of 106 places in 52 ms of which 1 ms to minimize.
[2024-05-27 08:04:36] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
[2024-05-27 08:04:37] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
[2024-05-27 08:04:41] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
[2024-05-27 08:04:42] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:04:42] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 7/654 constraints. Problems are: Problem set: 46 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/654 constraints. Problems are: Problem set: 46 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 654 constraints, problems are : Problem set: 46 solved, 281 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 196/196 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 303/327 constraints, Known Traps: 7/7 constraints]
After SMT, in 42743ms problems are : Problem set: 46 solved, 281 unsolved
Search for dead transitions found 46 dead transitions in 42748ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 196/439 places, 282/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 154 transition count 264
Applied a total of 60 rules in 2 ms. Remains 154 /196 variables (removed 42) and now considering 264/282 (removed 18) transitions.
// Phase 1: matrix 264 rows 154 cols
[2024-05-27 08:04:57] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:04:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:04:57] [INFO ] Invariant cache hit.
[2024-05-27 08:04:57] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-27 08:04:58] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/439 places, 264/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43816 ms. Remains : 154/439 places, 264/2184 transitions.
[2024-05-27 08:04:58] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:04:58] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:04:58] [INFO ] Input system was already deterministic with 264 transitions.
[2024-05-27 08:04:58] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:04:58] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:04:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17157587185220656174.gal : 7 ms
[2024-05-27 08:04:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13420367908900921996.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/CTLFireability17157587185220656174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13420367908900921996.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61784e+14,10.593,240424,2,43349,5,999058,6,0,880,919853,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:05:28] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:05:28] [INFO ] Applying decomposition
[2024-05-27 08:05:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5919927368856320639.txt' '-o' '/tmp/graph5919927368856320639.bin' '-w' '/tmp/graph5919927368856320639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5919927368856320639.bin' '-l' '-1' '-v' '-w' '/tmp/graph5919927368856320639.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:05:28] [INFO ] Decomposing Gal with order
[2024-05-27 08:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:05:28] [INFO ] Removed a total of 239 redundant transitions.
[2024-05-27 08:05:28] [INFO ] Flatten gal took : 56 ms
[2024-05-27 08:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 10 ms.
[2024-05-27 08:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9761353284240346409.gal : 4 ms
[2024-05-27 08:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12711046403262212273.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/CTLFireability9761353284240346409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12711046403262212273.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 : 439/439 places, 2184/2184 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 389 transition count 712
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 389 transition count 712
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 115 place count 389 transition count 697
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 210 place count 294 transition count 602
Iterating global reduction 1 with 95 rules applied. Total rules applied 305 place count 294 transition count 602
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 391 place count 294 transition count 516
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 499 place count 186 transition count 408
Iterating global reduction 2 with 108 rules applied. Total rules applied 607 place count 186 transition count 408
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 719 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 721 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 723 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 724 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 725 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 729 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 733 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 745 place count 179 transition count 253
Applied a total of 745 rules in 58 ms. Remains 179 /439 variables (removed 260) and now considering 253/2184 (removed 1931) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 08:05:58] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 08:05:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:05:58] [INFO ] Invariant cache hit.
[2024-05-27 08:05:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 08:05:58] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 08:05:58] [INFO ] Redundant transitions in 5 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-27 08:05:58] [INFO ] Invariant cache hit.
[2024-05-27 08:05:58] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 7794 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
[2024-05-27 08:06:13] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 3 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-05-27 08:06:13] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-27 08:06:13] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 4 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-27 08:06:15] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-27 08:06:15] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 08:06:15] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:06:16] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 7/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-27 08:06:25] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:06:27] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/432 variables, 2/503 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/503 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 503 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 9/9 constraints]
After SMT, in 38185ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 38189ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/439 places, 207/2184 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 12 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:06:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:06:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-27 08:06:37] [INFO ] Invariant cache hit.
[2024-05-27 08:06:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:06:37] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/439 places, 189/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 39014 ms. Remains : 137/439 places, 189/2184 transitions.
[2024-05-27 08:06:37] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:06:37] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:06:37] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-27 08:06:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:06:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12474703016652005492.gal : 2 ms
[2024-05-27 08:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3165114928194216408.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/CTLFireability12474703016652005492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3165114928194216408.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95037e+14,13.2448,291172,2,48402,5,1.12155e+06,6,0,737,1.11714e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:07:07] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:07:07] [INFO ] Applying decomposition
[2024-05-27 08:07:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11740150569733366856.txt' '-o' '/tmp/graph11740150569733366856.bin' '-w' '/tmp/graph11740150569733366856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11740150569733366856.bin' '-l' '-1' '-v' '-w' '/tmp/graph11740150569733366856.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:07:07] [INFO ] Decomposing Gal with order
[2024-05-27 08:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:07:07] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-27 08:07:07] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 5 ms.
[2024-05-27 08:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2066043606732260042.gal : 2 ms
[2024-05-27 08:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16506489288571317305.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/CTLFireability2066043606732260042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16506489288571317305.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 : 439/439 places, 2184/2184 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 389 transition count 655
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 389 transition count 655
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 110 place count 389 transition count 645
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 206 place count 293 transition count 549
Iterating global reduction 1 with 96 rules applied. Total rules applied 302 place count 293 transition count 549
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 371 place count 293 transition count 480
Discarding 112 places :
Symmetric choice reduction at 2 with 112 rule applications. Total rules 483 place count 181 transition count 368
Iterating global reduction 2 with 112 rules applied. Total rules applied 595 place count 181 transition count 368
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 687 place count 181 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 689 place count 179 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 691 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 692 place count 178 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 693 place count 178 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 694 place count 178 transition count 248
Applied a total of 694 rules in 18 ms. Remains 178 /439 variables (removed 261) and now considering 248/2184 (removed 1936) transitions.
// Phase 1: matrix 248 rows 178 cols
[2024-05-27 08:07:37] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:07:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 08:07:37] [INFO ] Invariant cache hit.
[2024-05-27 08:07:37] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-27 08:07:38] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-27 08:07:38] [INFO ] Invariant cache hit.
[2024-05-27 08:07:38] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/178 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 4 (OVERLAPS) 248/426 variables, 178/181 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 79/260 constraints. Problems are: Problem set: 24 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/260 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/260 constraints. Problems are: Problem set: 24 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 260 constraints, problems are : Problem set: 24 solved, 223 unsolved in 7083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 17/170 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 8/178 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 248/426 variables, 178/181 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 79/260 constraints. Problems are: Problem set: 24 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 223/483 constraints. Problems are: Problem set: 24 solved, 223 unsolved
[2024-05-27 08:07:50] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:07:51] [INFO ] Deduced a trap composed of 88 places in 41 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-05-27 08:07:51] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-27 08:07:51] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-05-27 08:07:53] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-27 08:07:54] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:07:54] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 7/490 constraints. Problems are: Problem set: 46 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/490 constraints. Problems are: Problem set: 46 solved, 201 unsolved
[2024-05-27 08:08:04] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-05-27 08:08:05] [INFO ] Deduced a trap composed of 107 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:08:05] [INFO ] Deduced a trap composed of 105 places in 61 ms of which 2 ms to minimize.
[2024-05-27 08:08:05] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 2 ms to minimize.
[2024-05-27 08:08:05] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/426 variables, 5/495 constraints. Problems are: Problem set: 46 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/495 constraints. Problems are: Problem set: 46 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 495 constraints, problems are : Problem set: 46 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 223/247 constraints, Known Traps: 12/12 constraints]
After SMT, in 37468ms problems are : Problem set: 46 solved, 201 unsolved
Search for dead transitions found 46 dead transitions in 37473ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/439 places, 202/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 136 transition count 184
Applied a total of 60 rules in 2 ms. Remains 136 /178 variables (removed 42) and now considering 184/202 (removed 18) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 08:08:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:08:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 08:08:15] [INFO ] Invariant cache hit.
[2024-05-27 08:08:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 08:08:15] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/439 places, 184/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38267 ms. Remains : 136/439 places, 184/2184 transitions.
[2024-05-27 08:08:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:08:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:08:15] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-27 08:08:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:08:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8120516686647246303.gal : 1 ms
[2024-05-27 08:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability7265649156722030581.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/CTLFireability8120516686647246303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7265649156722030581.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.34973e+14,6.37482,159752,2,30392,5,780629,6,0,728,723626,0
Converting to forward existential form...Done !
original formula: EF(AG(EX(((s1>=1)&&(l3360>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((s1>=1)&&(l3360>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t32, t33, t34, t35, t38, t47, t50, t56, t61, t68, t70, t71, t72,...591
Detected timeout of ITS tools.
[2024-05-27 08:08:45] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:08:45] [INFO ] Applying decomposition
[2024-05-27 08:08:45] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13950784722284594470.txt' '-o' '/tmp/graph13950784722284594470.bin' '-w' '/tmp/graph13950784722284594470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13950784722284594470.bin' '-l' '-1' '-v' '-w' '/tmp/graph13950784722284594470.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:08:46] [INFO ] Decomposing Gal with order
[2024-05-27 08:08:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:08:46] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-27 08:08:46] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 141 labels/synchronizations in 5 ms.
[2024-05-27 08:08:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9732476470114445997.gal : 9 ms
[2024-05-27 08:08:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12843423924229653315.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/CTLFireability9732476470114445997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12843423924229653315.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 : 439/439 places, 2184/2184 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 393 transition count 917
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 393 transition count 917
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 114 place count 393 transition count 895
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 205 place count 302 transition count 804
Iterating global reduction 1 with 91 rules applied. Total rules applied 296 place count 302 transition count 804
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 444 place count 302 transition count 656
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 536 place count 210 transition count 564
Iterating global reduction 2 with 92 rules applied. Total rules applied 628 place count 210 transition count 564
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 768 place count 210 transition count 424
Applied a total of 768 rules in 16 ms. Remains 210 /439 variables (removed 229) and now considering 424/2184 (removed 1760) transitions.
// Phase 1: matrix 424 rows 210 cols
[2024-05-27 08:09:16] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:09:16] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:09:16] [INFO ] Invariant cache hit.
[2024-05-27 08:09:16] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-27 08:09:16] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-05-27 08:09:16] [INFO ] Invariant cache hit.
[2024-05-27 08:09:16] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/210 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (OVERLAPS) 424/634 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 230/443 constraints. Problems are: Problem set: 24 solved, 399 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/443 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 0/634 variables, 0/443 constraints. Problems are: Problem set: 24 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 443 constraints, problems are : Problem set: 24 solved, 399 unsolved in 17887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 17/202 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 8/210 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 5 (OVERLAPS) 424/634 variables, 210/213 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 230/443 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 399/842 constraints. Problems are: Problem set: 24 solved, 399 unsolved
[2024-05-27 08:09:46] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 2 ms to minimize.
[2024-05-27 08:09:46] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:09:46] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:09:48] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-05-27 08:09:53] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
[2024-05-27 08:09:54] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-05-27 08:09:55] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 7/849 constraints. Problems are: Problem set: 46 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 849 constraints, problems are : Problem set: 46 solved, 377 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 210/210 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 399/423 constraints, Known Traps: 7/7 constraints]
After SMT, in 48773ms problems are : Problem set: 46 solved, 377 unsolved
Search for dead transitions found 46 dead transitions in 48776ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 210/439 places, 378/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 168 transition count 360
Applied a total of 60 rules in 2 ms. Remains 168 /210 variables (removed 42) and now considering 360/378 (removed 18) transitions.
// Phase 1: matrix 360 rows 168 cols
[2024-05-27 08:10:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:10:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 08:10:05] [INFO ] Invariant cache hit.
[2024-05-27 08:10:05] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-27 08:10:06] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 168/439 places, 360/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50255 ms. Remains : 168/439 places, 360/2184 transitions.
[2024-05-27 08:10:06] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:10:06] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:10:06] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-27 08:10:06] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:10:06] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14109211828812447020.gal : 1 ms
[2024-05-27 08:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4281409795386270684.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/CTLFireability14109211828812447020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4281409795386270684.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-27 08:10:36] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:10:36] [INFO ] Applying decomposition
[2024-05-27 08:10:36] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9936065593323047790.txt' '-o' '/tmp/graph9936065593323047790.bin' '-w' '/tmp/graph9936065593323047790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9936065593323047790.bin' '-l' '-1' '-v' '-w' '/tmp/graph9936065593323047790.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:10:36] [INFO ] Decomposing Gal with order
[2024-05-27 08:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:10:36] [INFO ] Removed a total of 364 redundant transitions.
[2024-05-27 08:10:36] [INFO ] Flatten gal took : 22 ms
[2024-05-27 08:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 9 ms.
[2024-05-27 08:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9269046110396569911.gal : 2 ms
[2024-05-27 08:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11321683772991027188.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/CTLFireability9269046110396569911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11321683772991027188.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 : 439/439 places, 2184/2184 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 394 transition count 879
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 394 transition count 879
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 114 place count 394 transition count 855
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 204 place count 304 transition count 765
Iterating global reduction 1 with 90 rules applied. Total rules applied 294 place count 304 transition count 765
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 424 place count 304 transition count 635
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 520 place count 208 transition count 539
Iterating global reduction 2 with 96 rules applied. Total rules applied 616 place count 208 transition count 539
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 756 place count 208 transition count 399
Applied a total of 756 rules in 43 ms. Remains 208 /439 variables (removed 231) and now considering 399/2184 (removed 1785) transitions.
// Phase 1: matrix 399 rows 208 cols
[2024-05-27 08:11:06] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 08:11:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 08:11:06] [INFO ] Invariant cache hit.
[2024-05-27 08:11:06] [INFO ] State equation strengthened by 206 read => feed constraints.
[2024-05-27 08:11:07] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2024-05-27 08:11:07] [INFO ] Redundant transitions in 11 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-27 08:11:07] [INFO ] Invariant cache hit.
[2024-05-27 08:11:07] [INFO ] State equation strengthened by 206 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/208 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 4 (OVERLAPS) 399/607 variables, 208/211 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 206/417 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 0/417 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 0/607 variables, 0/417 constraints. Problems are: Problem set: 24 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 417 constraints, problems are : Problem set: 24 solved, 374 unsolved in 16477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 208/208 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 17/200 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 8/208 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 399/607 variables, 208/211 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 206/417 constraints. Problems are: Problem set: 24 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 374/791 constraints. Problems are: Problem set: 24 solved, 374 unsolved
[2024-05-27 08:11:35] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-27 08:11:36] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-05-27 08:11:36] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
[2024-05-27 08:11:41] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
[2024-05-27 08:11:41] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-05-27 08:11:41] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 6/797 constraints. Problems are: Problem set: 46 solved, 352 unsolved
[2024-05-27 08:11:54] [INFO ] Deduced a trap composed of 108 places in 65 ms of which 2 ms to minimize.
[2024-05-27 08:11:54] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-27 08:11:54] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/607 variables, and 800 constraints, problems are : Problem set: 46 solved, 352 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 208/208 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 374/398 constraints, Known Traps: 9/9 constraints]
After SMT, in 47276ms problems are : Problem set: 46 solved, 352 unsolved
Search for dead transitions found 46 dead transitions in 47281ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 208/439 places, 353/2184 transitions.
Graph (complete) has 724 edges and 208 vertex of which 166 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 166 transition count 335
Applied a total of 19 rules in 13 ms. Remains 166 /208 variables (removed 42) and now considering 335/353 (removed 18) transitions.
// Phase 1: matrix 335 rows 166 cols
[2024-05-27 08:11:54] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:11:54] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 08:11:54] [INFO ] Invariant cache hit.
[2024-05-27 08:11:54] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-27 08:11:55] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 166/439 places, 335/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 48695 ms. Remains : 166/439 places, 335/2184 transitions.
[2024-05-27 08:11:55] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:11:55] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:11:55] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-27 08:11:55] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:11:55] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:11:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11933346066869961579.gal : 2 ms
[2024-05-27 08:11:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9554754852320823145.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/CTLFireability11933346066869961579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9554754852320823145.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-27 08:12:25] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:12:25] [INFO ] Applying decomposition
[2024-05-27 08:12:25] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8266484126765323787.txt' '-o' '/tmp/graph8266484126765323787.bin' '-w' '/tmp/graph8266484126765323787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8266484126765323787.bin' '-l' '-1' '-v' '-w' '/tmp/graph8266484126765323787.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:12:25] [INFO ] Decomposing Gal with order
[2024-05-27 08:12:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:12:25] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-27 08:12:25] [INFO ] Flatten gal took : 18 ms
[2024-05-27 08:12:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 211 labels/synchronizations in 7 ms.
[2024-05-27 08:12:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5991725076002349900.gal : 3 ms
[2024-05-27 08:12:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6534721440763368321.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/CTLFireability5991725076002349900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6534721440763368321.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 : 439/439 places, 2184/2184 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 390 transition count 752
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 390 transition count 752
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 111 place count 390 transition count 739
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 205 place count 296 transition count 645
Iterating global reduction 1 with 94 rules applied. Total rules applied 299 place count 296 transition count 645
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 398 place count 296 transition count 546
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 502 place count 192 transition count 442
Iterating global reduction 2 with 104 rules applied. Total rules applied 606 place count 192 transition count 442
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 730 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 731 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 732 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 733 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 734 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 738 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 742 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 762 place count 186 transition count 280
Applied a total of 762 rules in 18 ms. Remains 186 /439 variables (removed 253) and now considering 280/2184 (removed 1904) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 08:12:55] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:12:55] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 08:12:55] [INFO ] Invariant cache hit.
[2024-05-27 08:12:55] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 08:12:56] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-27 08:12:56] [INFO ] Invariant cache hit.
[2024-05-27 08:12:56] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 4 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 295 constraints, problems are : Problem set: 24 solved, 255 unsolved in 10005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 17/178 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 8/186 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 255/550 constraints. Problems are: Problem set: 24 solved, 255 unsolved
[2024-05-27 08:13:12] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-27 08:13:13] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 2 ms to minimize.
[2024-05-27 08:13:13] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-27 08:13:13] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:13:14] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:13:14] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
[2024-05-27 08:13:17] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 7/557 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:13:25] [INFO ] Deduced a trap composed of 100 places in 55 ms of which 2 ms to minimize.
[2024-05-27 08:13:25] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:13:25] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 3/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 560 constraints, problems are : Problem set: 46 solved, 233 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 255/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 40520ms problems are : Problem set: 46 solved, 233 unsolved
Search for dead transitions found 46 dead transitions in 40524ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/439 places, 234/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 144 transition count 216
Applied a total of 60 rules in 1 ms. Remains 144 /186 variables (removed 42) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:13:36] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 08:13:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 08:13:36] [INFO ] Invariant cache hit.
[2024-05-27 08:13:36] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:13:37] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 144/439 places, 216/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41506 ms. Remains : 144/439 places, 216/2184 transitions.
[2024-05-27 08:13:37] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:13:37] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-27 08:13:37] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:13:37] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:13:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17831380342875298561.gal : 3 ms
[2024-05-27 08:13:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15549412997344506573.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/CTLFireability17831380342875298561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15549412997344506573.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95037e+14,7.04072,171608,2,33575,5,814940,6,0,792,742425,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:14:07] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:14:07] [INFO ] Applying decomposition
[2024-05-27 08:14:07] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8338589765594217581.txt' '-o' '/tmp/graph8338589765594217581.bin' '-w' '/tmp/graph8338589765594217581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8338589765594217581.bin' '-l' '-1' '-v' '-w' '/tmp/graph8338589765594217581.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:14:07] [INFO ] Decomposing Gal with order
[2024-05-27 08:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:14:07] [INFO ] Removed a total of 193 redundant transitions.
[2024-05-27 08:14:07] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:14:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-27 08:14:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5657451319323841148.gal : 2 ms
[2024-05-27 08:14:07] [INFO ] Time to serialize properties into /tmp/CTLFireability11377368777222372651.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/CTLFireability5657451319323841148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11377368777222372651.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 : 439/439 places, 2184/2184 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 390 transition count 761
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 390 transition count 761
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 114 place count 390 transition count 745
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 208 place count 296 transition count 651
Iterating global reduction 1 with 94 rules applied. Total rules applied 302 place count 296 transition count 651
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 403 place count 296 transition count 550
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 507 place count 192 transition count 446
Iterating global reduction 2 with 104 rules applied. Total rules applied 611 place count 192 transition count 446
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 731 place count 192 transition count 326
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 732 place count 191 transition count 313
Iterating global reduction 3 with 1 rules applied. Total rules applied 733 place count 191 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 734 place count 190 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 735 place count 190 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 736 place count 190 transition count 311
Applied a total of 736 rules in 53 ms. Remains 190 /439 variables (removed 249) and now considering 311/2184 (removed 1873) transitions.
// Phase 1: matrix 311 rows 190 cols
[2024-05-27 08:14:37] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 08:14:37] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-27 08:14:37] [INFO ] Invariant cache hit.
[2024-05-27 08:14:37] [INFO ] State equation strengthened by 133 read => feed constraints.
[2024-05-27 08:14:37] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-27 08:14:37] [INFO ] Redundant transitions in 1 ms returned []
Running 310 sub problems to find dead transitions.
[2024-05-27 08:14:37] [INFO ] Invariant cache hit.
[2024-05-27 08:14:37] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
At refinement iteration 4 (OVERLAPS) 311/501 variables, 190/193 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 133/326 constraints. Problems are: Problem set: 24 solved, 286 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/326 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/326 constraints. Problems are: Problem set: 24 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 326 constraints, problems are : Problem set: 24 solved, 286 unsolved in 10363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 17/182 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 8/190 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 311/501 variables, 190/193 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 133/326 constraints. Problems are: Problem set: 24 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 286/612 constraints. Problems are: Problem set: 24 solved, 286 unsolved
[2024-05-27 08:14:55] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-27 08:14:56] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
[2024-05-27 08:14:59] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:14:59] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
[2024-05-27 08:15:00] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
[2024-05-27 08:15:00] [INFO ] Deduced a trap composed of 98 places in 50 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
[2024-05-27 08:15:00] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 7/619 constraints. Problems are: Problem set: 46 solved, 264 unsolved
[2024-05-27 08:15:03] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 1/620 constraints. Problems are: Problem set: 46 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/620 constraints. Problems are: Problem set: 46 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 620 constraints, problems are : Problem set: 46 solved, 264 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 286/310 constraints, Known Traps: 8/8 constraints]
After SMT, in 40918ms problems are : Problem set: 46 solved, 264 unsolved
Search for dead transitions found 46 dead transitions in 40921ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 190/439 places, 265/2184 transitions.
Graph (complete) has 603 edges and 190 vertex of which 148 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 148 transition count 247
Applied a total of 19 rules in 15 ms. Remains 148 /190 variables (removed 42) and now considering 247/265 (removed 18) transitions.
// Phase 1: matrix 247 rows 148 cols
[2024-05-27 08:15:18] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:15:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 08:15:18] [INFO ] Invariant cache hit.
[2024-05-27 08:15:18] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-27 08:15:19] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 148/439 places, 247/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41991 ms. Remains : 148/439 places, 247/2184 transitions.
[2024-05-27 08:15:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:15:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:15:19] [INFO ] Input system was already deterministic with 247 transitions.
[2024-05-27 08:15:19] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:15:19] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:15:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16792627090425795082.gal : 1 ms
[2024-05-27 08:15:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12716960322804846493.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/CTLFireability16792627090425795082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12716960322804846493.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.95157e+14,12,261276,2,42225,5,937882,6,0,839,1.05246e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:15:49] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:15:49] [INFO ] Applying decomposition
[2024-05-27 08:15:49] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16506743324385142090.txt' '-o' '/tmp/graph16506743324385142090.bin' '-w' '/tmp/graph16506743324385142090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16506743324385142090.bin' '-l' '-1' '-v' '-w' '/tmp/graph16506743324385142090.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:15:49] [INFO ] Decomposing Gal with order
[2024-05-27 08:15:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:15:49] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-27 08:15:49] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 3 ms.
[2024-05-27 08:15:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10287606108372376960.gal : 2 ms
[2024-05-27 08:15:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2577971587425164642.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/CTLFireability10287606108372376960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2577971587425164642.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 : 439/439 places, 2184/2184 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 389 transition count 712
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 389 transition count 712
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 115 place count 389 transition count 697
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 210 place count 294 transition count 602
Iterating global reduction 1 with 95 rules applied. Total rules applied 305 place count 294 transition count 602
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 391 place count 294 transition count 516
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 499 place count 186 transition count 408
Iterating global reduction 2 with 108 rules applied. Total rules applied 607 place count 186 transition count 408
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 719 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 721 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 723 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 724 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 725 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 729 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 733 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 745 place count 179 transition count 253
Applied a total of 745 rules in 32 ms. Remains 179 /439 variables (removed 260) and now considering 253/2184 (removed 1931) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 08:16:19] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:16:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:16:19] [INFO ] Invariant cache hit.
[2024-05-27 08:16:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 08:16:19] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-27 08:16:19] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-27 08:16:19] [INFO ] Invariant cache hit.
[2024-05-27 08:16:19] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 7663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
[2024-05-27 08:16:32] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-27 08:16:33] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-27 08:16:34] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-05-27 08:16:35] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-27 08:16:36] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-27 08:16:36] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:16:36] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 7/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-27 08:16:47] [INFO ] Deduced a trap composed of 110 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:16:47] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2024-05-27 08:16:47] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:16:47] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:16:48] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2024-05-27 08:16:48] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/432 variables, 6/507 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/507 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 507 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 13/13 constraints]
After SMT, in 38072ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 38076ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 179/439 places, 207/2184 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 4 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2024-05-27 08:16:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:16:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-27 08:16:58] [INFO ] Invariant cache hit.
[2024-05-27 08:16:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-27 08:16:58] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 137/439 places, 189/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 38901 ms. Remains : 137/439 places, 189/2184 transitions.
[2024-05-27 08:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:16:58] [INFO ] Input system was already deterministic with 189 transitions.
[2024-05-27 08:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:16:58] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:16:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6253734755943376120.gal : 1 ms
[2024-05-27 08:16:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11125288389095229088.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/CTLFireability6253734755943376120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11125288389095229088.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95037e+14,12.6152,277692,2,51261,5,1.09659e+06,6,0,737,1.09285e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:17:28] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:17:28] [INFO ] Applying decomposition
[2024-05-27 08:17:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17893424793480474334.txt' '-o' '/tmp/graph17893424793480474334.bin' '-w' '/tmp/graph17893424793480474334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17893424793480474334.bin' '-l' '-1' '-v' '-w' '/tmp/graph17893424793480474334.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:17:28] [INFO ] Decomposing Gal with order
[2024-05-27 08:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:17:28] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-27 08:17:28] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 3 ms.
[2024-05-27 08:17:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9459044961566458726.gal : 2 ms
[2024-05-27 08:17:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3008924573779266132.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/CTLFireability9459044961566458726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3008924573779266132.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 : 439/439 places, 2184/2184 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 399 transition count 1085
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 399 transition count 1085
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 109 place count 399 transition count 1056
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 197 place count 311 transition count 968
Iterating global reduction 1 with 88 rules applied. Total rules applied 285 place count 311 transition count 968
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 482 place count 311 transition count 771
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 562 place count 231 transition count 691
Iterating global reduction 2 with 80 rules applied. Total rules applied 642 place count 231 transition count 691
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Iterating post reduction 2 with 188 rules applied. Total rules applied 830 place count 231 transition count 503
Applied a total of 830 rules in 23 ms. Remains 231 /439 variables (removed 208) and now considering 503/2184 (removed 1681) transitions.
// Phase 1: matrix 503 rows 231 cols
[2024-05-27 08:17:58] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 08:17:58] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 08:17:58] [INFO ] Invariant cache hit.
[2024-05-27 08:17:58] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-27 08:17:59] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-27 08:17:59] [INFO ] Invariant cache hit.
[2024-05-27 08:17:59] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
At refinement iteration 4 (OVERLAPS) 503/734 variables, 231/234 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 292/526 constraints. Problems are: Problem set: 24 solved, 478 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 0/526 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 0/734 variables, 0/526 constraints. Problems are: Problem set: 24 solved, 478 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 526 constraints, problems are : Problem set: 24 solved, 478 unsolved in 26101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 231/231 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 17/223 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 8/231 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 5 (OVERLAPS) 503/734 variables, 231/234 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 292/526 constraints. Problems are: Problem set: 24 solved, 478 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 478/1004 constraints. Problems are: Problem set: 24 solved, 478 unsolved
[2024-05-27 08:18:44] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 1 ms to minimize.
[2024-05-27 08:18:46] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
[2024-05-27 08:18:46] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-27 08:18:46] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/734 variables, and 1008 constraints, problems are : Problem set: 36 solved, 466 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 231/231 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 478/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 57270ms problems are : Problem set: 36 solved, 466 unsolved
Search for dead transitions found 36 dead transitions in 57280ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 231/439 places, 467/2184 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 199 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 195 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 195 transition count 451
Applied a total of 52 rules in 4 ms. Remains 195 /231 variables (removed 36) and now considering 451/467 (removed 16) transitions.
// Phase 1: matrix 451 rows 195 cols
[2024-05-27 08:18:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-27 08:18:56] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 08:18:56] [INFO ] Invariant cache hit.
[2024-05-27 08:18:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-27 08:18:57] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 195/439 places, 451/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59161 ms. Remains : 195/439 places, 451/2184 transitions.
[2024-05-27 08:18:57] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:18:57] [INFO ] Flatten gal took : 19 ms
[2024-05-27 08:18:57] [INFO ] Input system was already deterministic with 451 transitions.
[2024-05-27 08:18:57] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:18:57] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:18:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6542651487151824645.gal : 1 ms
[2024-05-27 08:18:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14637226647316996421.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/CTLFireability6542651487151824645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14637226647316996421.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-27 08:19:27] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:19:27] [INFO ] Applying decomposition
[2024-05-27 08:19:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2391659555279873390.txt' '-o' '/tmp/graph2391659555279873390.bin' '-w' '/tmp/graph2391659555279873390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2391659555279873390.bin' '-l' '-1' '-v' '-w' '/tmp/graph2391659555279873390.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:19:27] [INFO ] Decomposing Gal with order
[2024-05-27 08:19:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:19:27] [INFO ] Removed a total of 342 redundant transitions.
[2024-05-27 08:19:27] [INFO ] Flatten gal took : 21 ms
[2024-05-27 08:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 6 ms.
[2024-05-27 08:19:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6739406645295543777.gal : 3 ms
[2024-05-27 08:19:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10727537863406145092.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/CTLFireability6739406645295543777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10727537863406145092.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 : 439/439 places, 2184/2184 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 390 transition count 770
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 390 transition count 770
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 117 place count 390 transition count 751
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 211 place count 296 transition count 657
Iterating global reduction 1 with 94 rules applied. Total rules applied 305 place count 296 transition count 657
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 408 place count 296 transition count 554
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 512 place count 192 transition count 450
Iterating global reduction 2 with 104 rules applied. Total rules applied 616 place count 192 transition count 450
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 748 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 749 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 750 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 751 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 752 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 756 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 760 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 780 place count 186 transition count 280
Applied a total of 780 rules in 37 ms. Remains 186 /439 variables (removed 253) and now considering 280/2184 (removed 1904) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 08:19:57] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:19:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 08:19:58] [INFO ] Invariant cache hit.
[2024-05-27 08:19:58] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 08:19:58] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-27 08:19:58] [INFO ] Redundant transitions in 3 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-27 08:19:58] [INFO ] Invariant cache hit.
[2024-05-27 08:19:58] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 4 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 295 constraints, problems are : Problem set: 24 solved, 255 unsolved in 10259 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 17/178 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 8/186 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 255/550 constraints. Problems are: Problem set: 24 solved, 255 unsolved
[2024-05-27 08:20:15] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2024-05-27 08:20:15] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:20:16] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:20:16] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:20:16] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:20:17] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
[2024-05-27 08:20:19] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 7/557 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:20:27] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-05-27 08:20:27] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:20:28] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 3/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 560 constraints, problems are : Problem set: 46 solved, 233 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 255/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 40719ms problems are : Problem set: 46 solved, 233 unsolved
Search for dead transitions found 46 dead transitions in 40724ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 186/439 places, 234/2184 transitions.
Graph (complete) has 564 edges and 186 vertex of which 144 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 144 transition count 216
Applied a total of 19 rules in 4 ms. Remains 144 /186 variables (removed 42) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:20:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:20:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 08:20:39] [INFO ] Invariant cache hit.
[2024-05-27 08:20:39] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:20:39] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 144/439 places, 216/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41743 ms. Remains : 144/439 places, 216/2184 transitions.
[2024-05-27 08:20:39] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:20:39] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:20:39] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-27 08:20:39] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:20:39] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:20:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12222718001967675433.gal : 2 ms
[2024-05-27 08:20:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10716428411498414216.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/CTLFireability12222718001967675433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10716428411498414216.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95037e+14,7.12837,176572,2,33124,5,824199,6,0,792,741348,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:21:09] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:21:09] [INFO ] Applying decomposition
[2024-05-27 08:21:09] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9977245354697366997.txt' '-o' '/tmp/graph9977245354697366997.bin' '-w' '/tmp/graph9977245354697366997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9977245354697366997.bin' '-l' '-1' '-v' '-w' '/tmp/graph9977245354697366997.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:21:09] [INFO ] Decomposing Gal with order
[2024-05-27 08:21:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:21:09] [INFO ] Removed a total of 256 redundant transitions.
[2024-05-27 08:21:09] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:21:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 3 ms.
[2024-05-27 08:21:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8024784707713119180.gal : 2 ms
[2024-05-27 08:21:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14867835035875095739.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/CTLFireability8024784707713119180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14867835035875095739.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 : 439/439 places, 2184/2184 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 390 transition count 761
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 390 transition count 761
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 114 place count 390 transition count 745
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 208 place count 296 transition count 651
Iterating global reduction 1 with 94 rules applied. Total rules applied 302 place count 296 transition count 651
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 403 place count 296 transition count 550
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 507 place count 192 transition count 446
Iterating global reduction 2 with 104 rules applied. Total rules applied 611 place count 192 transition count 446
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 739 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 740 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 741 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 742 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 743 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 747 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 751 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 771 place count 186 transition count 280
Applied a total of 771 rules in 35 ms. Remains 186 /439 variables (removed 253) and now considering 280/2184 (removed 1904) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 08:21:39] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:21:39] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 08:21:39] [INFO ] Invariant cache hit.
[2024-05-27 08:21:40] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 08:21:40] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-27 08:21:40] [INFO ] Redundant transitions in 1 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-27 08:21:40] [INFO ] Invariant cache hit.
[2024-05-27 08:21:40] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 4 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 295 constraints, problems are : Problem set: 24 solved, 255 unsolved in 9780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 17/178 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 8/186 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 280/466 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 106/295 constraints. Problems are: Problem set: 24 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 255/550 constraints. Problems are: Problem set: 24 solved, 255 unsolved
[2024-05-27 08:21:56] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 08:21:57] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-27 08:21:59] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
[2024-05-27 08:22:00] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-05-27 08:22:00] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
[2024-05-27 08:22:01] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:22:01] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 7/557 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:22:05] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:22:09] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 1 ms to minimize.
[2024-05-27 08:22:09] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 3/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/560 constraints. Problems are: Problem set: 46 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 560 constraints, problems are : Problem set: 46 solved, 233 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 255/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 40266ms problems are : Problem set: 46 solved, 233 unsolved
Search for dead transitions found 46 dead transitions in 40268ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 186/439 places, 234/2184 transitions.
Graph (complete) has 564 edges and 186 vertex of which 144 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 144 transition count 216
Applied a total of 19 rules in 7 ms. Remains 144 /186 variables (removed 42) and now considering 216/234 (removed 18) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-27 08:22:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:22:20] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 08:22:20] [INFO ] Invariant cache hit.
[2024-05-27 08:22:20] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:22:21] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 144/439 places, 216/2184 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41296 ms. Remains : 144/439 places, 216/2184 transitions.
[2024-05-27 08:22:21] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:22:21] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:22:21] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-27 08:22:21] [INFO ] Flatten gal took : 4 ms
[2024-05-27 08:22:21] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:22:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13532216124731021581.gal : 2 ms
[2024-05-27 08:22:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16015831843393371814.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/CTLFireability13532216124731021581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16015831843393371814.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95037e+14,6.79535,170188,2,33494,5,814730,6,0,792,742307,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:22:51] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:22:51] [INFO ] Applying decomposition
[2024-05-27 08:22:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5356435821364921591.txt' '-o' '/tmp/graph5356435821364921591.bin' '-w' '/tmp/graph5356435821364921591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5356435821364921591.bin' '-l' '-1' '-v' '-w' '/tmp/graph5356435821364921591.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:22:51] [INFO ] Decomposing Gal with order
[2024-05-27 08:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:22:51] [INFO ] Removed a total of 254 redundant transitions.
[2024-05-27 08:22:51] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 2 ms.
[2024-05-27 08:22:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5927051716347033009.gal : 3 ms
[2024-05-27 08:22:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13868741344609567713.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/CTLFireability5927051716347033009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13868741344609567713.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 : 439/439 places, 2184/2184 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 407 transition count 1387
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 407 transition count 1387
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 95 place count 407 transition count 1356
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 146 place count 356 transition count 1305
Iterating global reduction 1 with 51 rules applied. Total rules applied 197 place count 356 transition count 1305
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 337 place count 356 transition count 1165
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 412 place count 281 transition count 1090
Iterating global reduction 2 with 75 rules applied. Total rules applied 487 place count 281 transition count 1090
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Iterating post reduction 2 with 250 rules applied. Total rules applied 737 place count 281 transition count 840
Applied a total of 737 rules in 18 ms. Remains 281 /439 variables (removed 158) and now considering 840/2184 (removed 1344) transitions.
// Phase 1: matrix 840 rows 281 cols
[2024-05-27 08:23:21] [INFO ] Computed 3 invariants in 11 ms
[2024-05-27 08:23:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 08:23:21] [INFO ] Invariant cache hit.
[2024-05-27 08:23:21] [INFO ] State equation strengthened by 584 read => feed constraints.
[2024-05-27 08:23:22] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
Running 839 sub problems to find dead transitions.
[2024-05-27 08:23:22] [INFO ] Invariant cache hit.
[2024-05-27 08:23:22] [INFO ] State equation strengthened by 584 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 2 (OVERLAPS) 1/281 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 839 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 839 unsolved
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
At refinement iteration 4 (OVERLAPS) 840/1121 variables, 281/284 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1121 variables, 584/868 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1121 variables, 0/868 constraints. Problems are: Problem set: 24 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 868 constraints, problems are : Problem set: 24 solved, 815 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, ReadFeed: 584/584 constraints, PredecessorRefiner: 839/839 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 815 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 1 (OVERLAPS) 17/273 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 3 (OVERLAPS) 8/281 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 5 (OVERLAPS) 840/1121 variables, 281/284 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1121 variables, 584/868 constraints. Problems are: Problem set: 24 solved, 815 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1121 variables, 815/1683 constraints. Problems are: Problem set: 24 solved, 815 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 1683 constraints, problems are : Problem set: 24 solved, 815 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, ReadFeed: 584/584 constraints, PredecessorRefiner: 815/839 constraints, Known Traps: 0/0 constraints]
After SMT, in 62716ms problems are : Problem set: 24 solved, 815 unsolved
Search for dead transitions found 24 dead transitions in 62725ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 281/439 places, 816/2184 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 257 transition count 804
Applied a total of 36 rules in 4 ms. Remains 257 /281 variables (removed 24) and now considering 804/816 (removed 12) transitions.
// Phase 1: matrix 804 rows 257 cols
[2024-05-27 08:24:25] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 08:24:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 08:24:25] [INFO ] Invariant cache hit.
[2024-05-27 08:24:25] [INFO ] State equation strengthened by 580 read => feed constraints.
[2024-05-27 08:24:26] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/439 places, 804/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65198 ms. Remains : 257/439 places, 804/2184 transitions.
[2024-05-27 08:24:26] [INFO ] Flatten gal took : 18 ms
[2024-05-27 08:24:26] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:24:26] [INFO ] Input system was already deterministic with 804 transitions.
[2024-05-27 08:24:26] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:24:26] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:24:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8018857036376165370.gal : 4 ms
[2024-05-27 08:24:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2165328736605617677.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/CTLFireability8018857036376165370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2165328736605617677.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-27 08:24:56] [INFO ] Flatten gal took : 21 ms
[2024-05-27 08:24:56] [INFO ] Applying decomposition
[2024-05-27 08:24:56] [INFO ] Flatten gal took : 16 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/graph14916687054505969813.txt' '-o' '/tmp/graph14916687054505969813.bin' '-w' '/tmp/graph14916687054505969813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14916687054505969813.bin' '-l' '-1' '-v' '-w' '/tmp/graph14916687054505969813.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:24:56] [INFO ] Decomposing Gal with order
[2024-05-27 08:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:24:56] [INFO ] Removed a total of 613 redundant transitions.
[2024-05-27 08:24:56] [INFO ] Flatten gal took : 37 ms
[2024-05-27 08:24:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 7 ms.
[2024-05-27 08:24:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5724116643984558855.gal : 4 ms
[2024-05-27 08:24:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10294771561651117234.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/CTLFireability5724116643984558855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10294771561651117234.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 : 439/439 places, 2184/2184 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 391 transition count 819
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 391 transition count 819
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 116 place count 391 transition count 799
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 209 place count 298 transition count 706
Iterating global reduction 1 with 93 rules applied. Total rules applied 302 place count 298 transition count 706
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 420 place count 298 transition count 588
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 520 place count 198 transition count 488
Iterating global reduction 2 with 100 rules applied. Total rules applied 620 place count 198 transition count 488
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 756 place count 198 transition count 352
Applied a total of 756 rules in 18 ms. Remains 198 /439 variables (removed 241) and now considering 352/2184 (removed 1832) transitions.
// Phase 1: matrix 352 rows 198 cols
[2024-05-27 08:25:26] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 08:25:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:25:26] [INFO ] Invariant cache hit.
[2024-05-27 08:25:27] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-27 08:25:27] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2024-05-27 08:25:27] [INFO ] Invariant cache hit.
[2024-05-27 08:25:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 4 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 0/550 variables, 0/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 369 constraints, problems are : Problem set: 24 solved, 327 unsolved in 13777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 17/190 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 8/198 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 352/550 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 168/369 constraints. Problems are: Problem set: 24 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 327/696 constraints. Problems are: Problem set: 24 solved, 327 unsolved
[2024-05-27 08:25:52] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-27 08:25:52] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 08:25:52] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
[2024-05-27 08:25:55] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
[2024-05-27 08:25:56] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
[2024-05-27 08:25:56] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2024-05-27 08:25:56] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 7/703 constraints. Problems are: Problem set: 46 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/703 constraints. Problems are: Problem set: 46 solved, 305 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 Int declared 550/550 variables, and 703 constraints, problems are : Problem set: 46 solved, 305 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 327/351 constraints, Known Traps: 7/7 constraints]
After SMT, in 44450ms problems are : Problem set: 46 solved, 305 unsolved
Search for dead transitions found 46 dead transitions in 44457ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/439 places, 306/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 156 transition count 288
Applied a total of 60 rules in 2 ms. Remains 156 /198 variables (removed 42) and now considering 288/306 (removed 18) transitions.
// Phase 1: matrix 288 rows 156 cols
[2024-05-27 08:26:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:26:12] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:26:12] [INFO ] Invariant cache hit.
[2024-05-27 08:26:12] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 08:26:12] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/439 places, 288/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45701 ms. Remains : 156/439 places, 288/2184 transitions.
[2024-05-27 08:26:12] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:26:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:26:12] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-27 08:26:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:26:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:26:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9003580288937881217.gal : 1 ms
[2024-05-27 08:26:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12751565173908028231.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/CTLFireability9003580288937881217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12751565173908028231.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.95157e+14,13.8705,323980,2,49632,5,990824,6,0,912,1.08252e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 08:26:42] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:26:42] [INFO ] Applying decomposition
[2024-05-27 08:26:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8730735811843309746.txt' '-o' '/tmp/graph8730735811843309746.bin' '-w' '/tmp/graph8730735811843309746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8730735811843309746.bin' '-l' '-1' '-v' '-w' '/tmp/graph8730735811843309746.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:26:42] [INFO ] Decomposing Gal with order
[2024-05-27 08:26:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:26:42] [INFO ] Removed a total of 367 redundant transitions.
[2024-05-27 08:26:42] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 2 ms.
[2024-05-27 08:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7380797214949595361.gal : 2 ms
[2024-05-27 08:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11394408685686366333.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/CTLFireability7380797214949595361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11394408685686366333.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 : 439/439 places, 2184/2184 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 393 transition count 878
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 393 transition count 878
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 116 place count 393 transition count 854
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 207 place count 302 transition count 763
Iterating global reduction 1 with 91 rules applied. Total rules applied 298 place count 302 transition count 763
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 431 place count 302 transition count 630
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 527 place count 206 transition count 534
Iterating global reduction 2 with 96 rules applied. Total rules applied 623 place count 206 transition count 534
Ensure Unique test removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 775 place count 206 transition count 382
Applied a total of 775 rules in 19 ms. Remains 206 /439 variables (removed 233) and now considering 382/2184 (removed 1802) transitions.
// Phase 1: matrix 382 rows 206 cols
[2024-05-27 08:27:12] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:27:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 08:27:12] [INFO ] Invariant cache hit.
[2024-05-27 08:27:12] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-05-27 08:27:13] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-05-27 08:27:13] [INFO ] Invariant cache hit.
[2024-05-27 08:27:13] [INFO ] State equation strengthened by 191 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 4 (OVERLAPS) 382/588 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 191/400 constraints. Problems are: Problem set: 24 solved, 357 unsolved
[2024-05-27 08:27:21] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-27 08:27:21] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-05-27 08:27:21] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 2 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 3/403 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/403 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 8 (OVERLAPS) 0/588 variables, 0/403 constraints. Problems are: Problem set: 44 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 403 constraints, problems are : Problem set: 44 solved, 337 unsolved in 19656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 44 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 25/190 variables, 2/2 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 3 (OVERLAPS) 16/206 variables, 1/3 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/6 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/6 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 382/588 variables, 206/212 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 191/403 constraints. Problems are: Problem set: 44 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 337/740 constraints. Problems are: Problem set: 44 solved, 337 unsolved
[2024-05-27 08:27:48] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-05-27 08:27:49] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-05-27 08:27:50] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
Problem TDEAD325 is UNSAT
[2024-05-27 08:27:50] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
Problem TDEAD329 is UNSAT
[2024-05-27 08:27:50] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
[2024-05-27 08:27:51] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 6/746 constraints. Problems are: Problem set: 46 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 746 constraints, problems are : Problem set: 46 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 337/381 constraints, Known Traps: 9/9 constraints]
After SMT, in 50408ms problems are : Problem set: 46 solved, 335 unsolved
Search for dead transitions found 46 dead transitions in 50415ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/439 places, 336/2184 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 164 transition count 318
Applied a total of 60 rules in 1 ms. Remains 164 /206 variables (removed 42) and now considering 318/336 (removed 18) transitions.
// Phase 1: matrix 318 rows 164 cols
[2024-05-27 08:28:04] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:28:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 08:28:04] [INFO ] Invariant cache hit.
[2024-05-27 08:28:04] [INFO ] State equation strengthened by 183 read => feed constraints.
[2024-05-27 08:28:04] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/439 places, 318/2184 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51732 ms. Remains : 164/439 places, 318/2184 transitions.
[2024-05-27 08:28:04] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:28:04] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:28:04] [INFO ] Input system was already deterministic with 318 transitions.
[2024-05-27 08:28:04] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:28:04] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:28:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14492071619522130731.gal : 1 ms
[2024-05-27 08:28:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17786921201667863744.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/CTLFireability14492071619522130731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17786921201667863744.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-27 08:28:34] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:28:34] [INFO ] Applying decomposition
[2024-05-27 08:28:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11125562921952351059.txt' '-o' '/tmp/graph11125562921952351059.bin' '-w' '/tmp/graph11125562921952351059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11125562921952351059.bin' '-l' '-1' '-v' '-w' '/tmp/graph11125562921952351059.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:28:34] [INFO ] Decomposing Gal with order
[2024-05-27 08:28:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:28:34] [INFO ] Removed a total of 440 redundant transitions.
[2024-05-27 08:28:34] [INFO ] Flatten gal took : 15 ms
[2024-05-27 08:28:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 3 ms.
[2024-05-27 08:28:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8870602285059447517.gal : 2 ms
[2024-05-27 08:28:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13400349433756013886.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/CTLFireability8870602285059447517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13400349433756013886.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.
[2024-05-27 08:29:04] [INFO ] Flatten gal took : 44 ms
[2024-05-27 08:29:04] [INFO ] Flatten gal took : 46 ms
[2024-05-27 08:29:04] [INFO ] Applying decomposition
[2024-05-27 08:29:04] [INFO ] Flatten gal took : 45 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/graph16375479249593384803.txt' '-o' '/tmp/graph16375479249593384803.bin' '-w' '/tmp/graph16375479249593384803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16375479249593384803.bin' '-l' '-1' '-v' '-w' '/tmp/graph16375479249593384803.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:29:04] [INFO ] Decomposing Gal with order
[2024-05-27 08:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:29:05] [INFO ] Removed a total of 1870 redundant transitions.
[2024-05-27 08:29:05] [INFO ] Flatten gal took : 406 ms
[2024-05-27 08:29:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1550 labels/synchronizations in 38 ms.
[2024-05-27 08:29:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2817448784823700909.gal : 7 ms
[2024-05-27 08:29:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16833690881216602265.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/CTLFireability2817448784823700909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16833690881216602265.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-27 08:33:23] [INFO ] Flatten gal took : 58 ms
[2024-05-27 08:33:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17639762546144245684.gal : 7 ms
[2024-05-27 08:33:23] [INFO ] Time to serialize properties into /tmp/CTLFireability338846037910324046.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/CTLFireability17639762546144245684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability338846037910324046.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-27 08:40:14] [INFO ] Flatten gal took : 52 ms
[2024-05-27 08:40:14] [INFO ] Input system was already deterministic with 2184 transitions.
[2024-05-27 08:40:14] [INFO ] Transformed 439 places.
[2024-05-27 08:40:14] [INFO ] Transformed 2184 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-27 08:40:14] [INFO ] Time to serialize gal into /tmp/CTLFireability902966772921425783.gal : 6 ms
[2024-05-27 08:40:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8086357844226885812.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/CTLFireability902966772921425783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8086357844226885812.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2685559 ms.
BK_STOP 1716799608044
--------------------
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="RingSingleMessageInMbox-PT-d1m040"
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 RingSingleMessageInMbox-PT-d1m040, 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 r334-tall-171679079600082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m040.tgz
mv RingSingleMessageInMbox-PT-d1m040 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 ;