About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.804 | 3600000.00 | 3768612.00 | 8551.20 | ???FT????FT????T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079500074.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-d1m020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 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-d1m020-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716795885213
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-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 07:44:46] [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 07:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:44:46] [INFO ] Load time of PNML (sax parser for PT used): 446 ms
[2024-05-27 07:44:46] [INFO ] Transformed 6690 places.
[2024-05-27 07:44:46] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:44:46] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 4305 places in 36 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 69 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 1060 places :
Symmetric choice reduction at 1 with 1060 rule applications. Total rules 1179 place count 1308 transition count 10359
Iterating global reduction 1 with 1060 rules applied. Total rules applied 2239 place count 1308 transition count 10359
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 2662 place count 1308 transition count 9936
Discarding 852 places :
Symmetric choice reduction at 2 with 852 rule applications. Total rules 3514 place count 456 transition count 9084
Iterating global reduction 2 with 852 rules applied. Total rules applied 4366 place count 456 transition count 9084
Ensure Unique test removed 6909 transitions
Reduce isomorphic transitions removed 6909 transitions.
Iterating post reduction 2 with 6909 rules applied. Total rules applied 11275 place count 456 transition count 2175
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 11288 place count 443 transition count 2162
Iterating global reduction 3 with 13 rules applied. Total rules applied 11301 place count 443 transition count 2162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11302 place count 443 transition count 2161
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 11308 place count 437 transition count 2155
Iterating global reduction 4 with 6 rules applied. Total rules applied 11314 place count 437 transition count 2155
Applied a total of 11314 rules in 433 ms. Remains 437 /2385 variables (removed 1948) and now considering 2155/11934 (removed 9779) transitions.
// Phase 1: matrix 2155 rows 437 cols
[2024-05-27 07:44:47] [INFO ] Computed 3 invariants in 37 ms
[2024-05-27 07:44:48] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-27 07:44:48] [INFO ] Invariant cache hit.
[2024-05-27 07:44:48] [INFO ] State equation strengthened by 1761 read => feed constraints.
[2024-05-27 07:44:52] [INFO ] Implicit Places using invariants and state equation in 4095 ms returned []
Implicit Place search using SMT with State Equation took 4557 ms to find 0 implicit places.
Running 2154 sub problems to find dead transitions.
[2024-05-27 07:44:52] [INFO ] Invariant cache hit.
[2024-05-27 07:44:52] [INFO ] State equation strengthened by 1761 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/2592 variables, and 3 constraints, problems are : Problem set: 0 solved, 2154 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/437 constraints, ReadFeed: 0/1761 constraints, PredecessorRefiner: 2154/2154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/2592 variables, and 3 constraints, problems are : Problem set: 0 solved, 2154 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/437 constraints, ReadFeed: 0/1761 constraints, PredecessorRefiner: 0/2154 constraints, Known Traps: 0/0 constraints]
After SMT, in 71955ms problems are : Problem set: 0 solved, 2154 unsolved
Search for dead transitions found 0 dead transitions in 71988ms
Starting structural reductions in LTL mode, iteration 1 : 437/2385 places, 2155/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77009 ms. Remains : 437/2385 places, 2155/11934 transitions.
Support contains 69 out of 437 places after structural reductions.
[2024-05-27 07:46:04] [INFO ] Flatten gal took : 142 ms
[2024-05-27 07:46:04] [INFO ] Flatten gal took : 104 ms
[2024-05-27 07:46:04] [INFO ] Input system was already deterministic with 2155 transitions.
Reduction of identical properties reduced properties to check from 72 to 69
RANDOM walk for 40000 steps (6509 resets) in 4195 ms. (9 steps per ms) remains 11/69 properties
BEST_FIRST walk for 40004 steps (762 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (614 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (602 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (485 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (760 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (667 resets) in 126 ms. (314 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (620 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (630 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (642 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (648 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (760 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
[2024-05-27 07:46:06] [INFO ] Invariant cache hit.
[2024-05-27 07:46:06] [INFO ] State equation strengthened by 1761 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 123/148 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 45/193 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1151/1344 variables, 193/196 constraints. Problems are: Problem set: 3 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1344 variables, 757/953 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1344 variables, 0/953 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 8 (OVERLAPS) 1248/2592 variables, 244/1197 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2592 variables, 1004/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2592 variables, 0/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2592 variables, 0/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2592/2592 variables, and 2201 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 437/437 constraints, ReadFeed: 1761/1761 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/123 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/131 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/176 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 425/601 variables, 176/179 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 31/210 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1987/2588 variables, 257/467 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2588 variables, 1730/2197 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2588 variables, 2/2199 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2588 variables, 0/2199 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/2592 variables, 4/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2592 variables, 0/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2592 variables, 0/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2592/2592 variables, and 2203 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2278 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 437/437 constraints, ReadFeed: 1761/1761 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 4509ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 710 ms.
Support contains 4 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Graph (complete) has 2943 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 436 transition count 2146
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 73 place count 373 transition count 618
Iterating global reduction 1 with 63 rules applied. Total rules applied 136 place count 373 transition count 618
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 152 place count 373 transition count 602
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 228 place count 297 transition count 526
Iterating global reduction 2 with 76 rules applied. Total rules applied 304 place count 297 transition count 526
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 351 place count 297 transition count 479
Discarding 116 places :
Symmetric choice reduction at 3 with 116 rule applications. Total rules 467 place count 181 transition count 363
Iterating global reduction 3 with 116 rules applied. Total rules applied 583 place count 181 transition count 363
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 679 place count 181 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 682 place count 178 transition count 228
Iterating global reduction 4 with 3 rules applied. Total rules applied 685 place count 178 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 687 place count 176 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 689 place count 176 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 690 place count 176 transition count 225
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 694 place count 172 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 698 place count 172 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 702 place count 172 transition count 217
Applied a total of 702 rules in 102 ms. Remains 172 /437 variables (removed 265) and now considering 217/2155 (removed 1938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 172/437 places, 217/2155 transitions.
RANDOM walk for 40000 steps (8513 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2941 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1495 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 905938 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 905938 steps, saw 401580 distinct states, run finished after 3004 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 217 rows 172 cols
[2024-05-27 07:46:15] [INFO ] Computed 4 invariants in 7 ms
[2024-05-27 07:46:15] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 200/335 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 36/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/385 variables, 33/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 17/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/389 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 07:46:15] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/335 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 36/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 50/385 variables, 33/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/389 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 484 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 945ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 217/217 transitions.
Applied a total of 0 rules in 13 ms. Remains 172 /172 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 172/172 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-27 07:46:16] [INFO ] Invariant cache hit.
[2024-05-27 07:46:16] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 07:46:16] [INFO ] Invariant cache hit.
[2024-05-27 07:46:16] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:46:17] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-27 07:46:17] [INFO ] Redundant transitions in 7 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-27 07:46:17] [INFO ] Invariant cache hit.
[2024-05-27 07:46:17] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-27 07:46:18] [INFO ] Deduced a trap composed of 68 places in 43 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 07:46:19] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
[2024-05-27 07:46:19] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 204 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 TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 4 (OVERLAPS) 217/389 variables, 172/180 constraints. Problems are: Problem set: 36 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 53/233 constraints. Problems are: Problem set: 36 solved, 180 unsolved
[2024-05-27 07:46:21] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 2 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 TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/234 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:23] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:46:24] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 2/236 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:25] [INFO ] Deduced a trap composed of 93 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/237 constraints. Problems are: Problem set: 46 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 237 constraints, problems are : Problem set: 46 solved, 170 unsolved in 12450 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 46 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 43/172 variables, 4/4 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/12 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:30] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:46:30] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-27 07:46:30] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-27 07:46:30] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 4/16 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:31] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:46:31] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 2/18 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 217/389 variables, 172/190 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 53/243 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 170/413 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:34] [INFO ] Deduced a trap composed of 98 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 1/414 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/414 constraints. Problems are: Problem set: 46 solved, 170 unsolved
[2024-05-27 07:46:45] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/389 variables, 1/415 constraints. Problems are: Problem set: 46 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/415 constraints. Problems are: Problem set: 46 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 415 constraints, problems are : Problem set: 46 solved, 170 unsolved in 30008 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 170/216 constraints, Known Traps: 16/16 constraints]
After SMT, in 42810ms problems are : Problem set: 46 solved, 170 unsolved
Search for dead transitions found 46 dead transitions in 42815ms
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 : 172/172 places, 171/217 transitions.
Graph (complete) has 438 edges and 172 vertex of which 130 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 128 transition count 153
Applied a total of 21 rules in 11 ms. Remains 128 /172 variables (removed 44) and now considering 153/171 (removed 18) transitions.
// Phase 1: matrix 153 rows 128 cols
[2024-05-27 07:46:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 07:46:59] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:46:59] [INFO ] Invariant cache hit.
[2024-05-27 07:47:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-27 07:47:00] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 128/172 places, 153/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43689 ms. Remains : 128/172 places, 153/217 transitions.
RANDOM walk for 40000 steps (8514 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2899 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1476 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1139652 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 2
Probabilistic random walk after 1139652 steps, saw 497417 distinct states, run finished after 3001 ms. (steps per millisecond=379 ) properties seen :0
[2024-05-27 07:47:03] [INFO ] Invariant cache hit.
[2024-05-27 07:47:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 160/273 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 44/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/281 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 174 constraints, problems are : Problem set: 0 solved, 2 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 160/273 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 44/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/281 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/281 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 152 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 153/153 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 127 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 125 transition count 150
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 123 transition count 148
Applied a total of 10 rules in 14 ms. Remains 123 /128 variables (removed 5) and now considering 148/153 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 123/128 places, 148/153 transitions.
RANDOM walk for 40000 steps (8451 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2944 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2816076 steps, run timeout after 3001 ms. (steps per millisecond=938 ) properties seen :0 out of 1
Probabilistic random walk after 2816076 steps, saw 1213719 distinct states, run finished after 3002 ms. (steps per millisecond=938 ) properties seen :0
// Phase 1: matrix 148 rows 123 cols
[2024-05-27 07:47:06] [INFO ] Computed 1 invariants in 4 ms
[2024-05-27 07:47:06] [INFO ] State equation strengthened by 48 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/221 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 41/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/223 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/271 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/221 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 41/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/223 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/271 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 123/123 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-27 07:47:07] [INFO ] Invariant cache hit.
[2024-05-27 07:47:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:47:07] [INFO ] Invariant cache hit.
[2024-05-27 07:47:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-27 07:47:07] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-27 07:47:07] [INFO ] Redundant transitions in 5 ms returned []
Running 147 sub problems to find dead transitions.
[2024-05-27 07:47:07] [INFO ] Invariant cache hit.
[2024-05-27 07:47:07] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/271 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 172 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/271 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 147/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 319 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 11092ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 11093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11338 ms. Remains : 123/123 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 rules applied. Total rules applied 6 place count 123 transition count 142
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 119 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 117 transition count 140
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 14 place count 117 transition count 115
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 64 place count 92 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 88 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 87 transition count 117
Applied a total of 74 rules in 22 ms. Remains 87 /123 variables (removed 36) and now considering 117/148 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 87 cols
[2024-05-27 07:47:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 07:47:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 07:47:18] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-27 07:47:18] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 07:47:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 07:47:18] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 07:47:18] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 07:47:18] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 07:47:18] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 206 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:47:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 07:47:18] [INFO ] Flatten gal took : 80 ms
[2024-05-27 07:47:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:47:18] [INFO ] Flatten gal took : 90 ms
[2024-05-27 07:47:19] [INFO ] Input system was already deterministic with 2155 transitions.
Support contains 55 out of 437 places (down from 57) after GAL structural reductions.
Computed a total of 140 stabilizing places and 1030 stable transitions
Graph (complete) has 3034 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1039
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1039
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 149 place count 382 transition count 1000
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 216 place count 315 transition count 933
Iterating global reduction 1 with 67 rules applied. Total rules applied 283 place count 315 transition count 933
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 417 place count 315 transition count 799
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 501 place count 231 transition count 715
Iterating global reduction 2 with 84 rules applied. Total rules applied 585 place count 231 transition count 715
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 761 place count 231 transition count 539
Applied a total of 761 rules in 94 ms. Remains 231 /437 variables (removed 206) and now considering 539/2155 (removed 1616) transitions.
// Phase 1: matrix 539 rows 231 cols
[2024-05-27 07:47:19] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:47:19] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-27 07:47:19] [INFO ] Invariant cache hit.
[2024-05-27 07:47:19] [INFO ] State equation strengthened by 327 read => feed constraints.
[2024-05-27 07:47:20] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-27 07:47:20] [INFO ] Redundant transitions in 16 ms returned []
Running 538 sub problems to find dead transitions.
[2024-05-27 07:47:20] [INFO ] Invariant cache hit.
[2024-05-27 07:47:20] [INFO ] State equation strengthened by 327 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 1/231 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
At refinement iteration 4 (OVERLAPS) 539/770 variables, 231/234 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/770 variables, 327/561 constraints. Problems are: Problem set: 24 solved, 514 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/561 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 7 (OVERLAPS) 0/770 variables, 0/561 constraints. Problems are: Problem set: 24 solved, 514 unsolved
No progress, stopping.
After SMT solving in domain Real declared 770/770 variables, and 561 constraints, problems are : Problem set: 24 solved, 514 unsolved in 27841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 231/231 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 514 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 1 (OVERLAPS) 17/223 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 3 (OVERLAPS) 8/231 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 5 (OVERLAPS) 539/770 variables, 231/234 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 327/561 constraints. Problems are: Problem set: 24 solved, 514 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 514/1075 constraints. Problems are: Problem set: 24 solved, 514 unsolved
[2024-05-27 07:48:09] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 6 ms to minimize.
[2024-05-27 07:48:11] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-27 07:48:11] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-27 07:48:12] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/770 variables, and 1079 constraints, problems are : Problem set: 36 solved, 502 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 231/231 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 514/538 constraints, Known Traps: 4/4 constraints]
After SMT, in 59283ms problems are : Problem set: 36 solved, 502 unsolved
Search for dead transitions found 36 dead transitions in 59295ms
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 SI_CTL mode, iteration 1 : 231/437 places, 503/2155 transitions.
Graph (complete) has 936 edges and 231 vertex of which 199 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 199 transition count 491
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 195 transition count 487
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 195 transition count 487
Applied a total of 21 rules in 31 ms. Remains 195 /231 variables (removed 36) and now considering 487/503 (removed 16) transitions.
// Phase 1: matrix 487 rows 195 cols
[2024-05-27 07:48:19] [INFO ] Computed 1 invariants in 3 ms
[2024-05-27 07:48:19] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 07:48:19] [INFO ] Invariant cache hit.
[2024-05-27 07:48:19] [INFO ] State equation strengthened by 319 read => feed constraints.
[2024-05-27 07:48:20] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 195/437 places, 487/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 61360 ms. Remains : 195/437 places, 487/2155 transitions.
[2024-05-27 07:48:20] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:48:20] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:48:20] [INFO ] Input system was already deterministic with 487 transitions.
[2024-05-27 07:48:20] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:48:20] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:48:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3871965421206176302.gal : 10 ms
[2024-05-27 07:48:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1693745293889016360.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/CTLFireability3871965421206176302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1693745293889016360.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,2.91533e+11,27.8179,624264,2,26228,5,1.88285e+06,6,0,1267,1.20684e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 07:48:50] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:48:50] [INFO ] Applying decomposition
[2024-05-27 07:48:50] [INFO ] Flatten gal took : 13 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/graph13987676602994135155.txt' '-o' '/tmp/graph13987676602994135155.bin' '-w' '/tmp/graph13987676602994135155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13987676602994135155.bin' '-l' '-1' '-v' '-w' '/tmp/graph13987676602994135155.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:48:50] [INFO ] Decomposing Gal with order
[2024-05-27 07:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:48:50] [INFO ] Removed a total of 536 redundant transitions.
[2024-05-27 07:48:50] [INFO ] Flatten gal took : 106 ms
[2024-05-27 07:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 290 labels/synchronizations in 39 ms.
[2024-05-27 07:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability625062909763159579.gal : 17 ms
[2024-05-27 07:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14583244218401445378.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/CTLFireability625062909763159579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14583244218401445378.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 : 437/437 places, 2155/2155 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 381 transition count 988
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 381 transition count 988
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 152 place count 381 transition count 948
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 220 place count 313 transition count 880
Iterating global reduction 1 with 68 rules applied. Total rules applied 288 place count 313 transition count 880
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 411 place count 313 transition count 757
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 499 place count 225 transition count 669
Iterating global reduction 2 with 88 rules applied. Total rules applied 587 place count 225 transition count 669
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 2 with 208 rules applied. Total rules applied 795 place count 225 transition count 461
Applied a total of 795 rules in 25 ms. Remains 225 /437 variables (removed 212) and now considering 461/2155 (removed 1694) transitions.
// Phase 1: matrix 461 rows 225 cols
[2024-05-27 07:49:21] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 07:49:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-27 07:49:21] [INFO ] Invariant cache hit.
[2024-05-27 07:49:21] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-27 07:49:22] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-27 07:49:22] [INFO ] Invariant cache hit.
[2024-05-27 07:49:22] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/225 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 4 (OVERLAPS) 461/686 variables, 225/228 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/686 variables, 254/482 constraints. Problems are: Problem set: 24 solved, 436 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 0/482 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 7 (OVERLAPS) 0/686 variables, 0/482 constraints. Problems are: Problem set: 24 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 482 constraints, problems are : Problem set: 24 solved, 436 unsolved in 22360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 17/217 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 8/225 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 461/686 variables, 225/228 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/686 variables, 254/482 constraints. Problems are: Problem set: 24 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 436/918 constraints. Problems are: Problem set: 24 solved, 436 unsolved
[2024-05-27 07:49:59] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 2 ms to minimize.
[2024-05-27 07:50:00] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:50:00] [INFO ] Deduced a trap composed of 106 places in 49 ms of which 3 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-05-27 07:50:02] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-05-27 07:50:08] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
[2024-05-27 07:50:09] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
[2024-05-27 07:50:09] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:50:09] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 8/926 constraints. Problems are: Problem set: 46 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 686/686 variables, and 926 constraints, problems are : Problem set: 46 solved, 414 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 225/225 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 436/460 constraints, Known Traps: 8/8 constraints]
After SMT, in 53519ms problems are : Problem set: 46 solved, 414 unsolved
Search for dead transitions found 46 dead transitions in 53527ms
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 : 225/437 places, 415/2155 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 183 transition count 397
Applied a total of 60 rules in 2 ms. Remains 183 /225 variables (removed 42) and now considering 397/415 (removed 18) transitions.
// Phase 1: matrix 397 rows 183 cols
[2024-05-27 07:50:15] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:50:15] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-27 07:50:15] [INFO ] Invariant cache hit.
[2024-05-27 07:50:15] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-27 07:50:16] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/437 places, 397/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55114 ms. Remains : 183/437 places, 397/2155 transitions.
[2024-05-27 07:50:16] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:50:16] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:50:16] [INFO ] Input system was already deterministic with 397 transitions.
[2024-05-27 07:50:16] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:50:16] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6305821518711408486.gal : 2 ms
[2024-05-27 07:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17296182512522284656.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/CTLFireability6305821518711408486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17296182512522284656.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 07:50:46] [INFO ] Flatten gal took : 15 ms
[2024-05-27 07:50:46] [INFO ] Applying decomposition
[2024-05-27 07:50:46] [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/graph6071768547101281121.txt' '-o' '/tmp/graph6071768547101281121.bin' '-w' '/tmp/graph6071768547101281121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6071768547101281121.bin' '-l' '-1' '-v' '-w' '/tmp/graph6071768547101281121.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:50:46] [INFO ] Decomposing Gal with order
[2024-05-27 07:50:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:50:46] [INFO ] Removed a total of 321 redundant transitions.
[2024-05-27 07:50:46] [INFO ] Flatten gal took : 26 ms
[2024-05-27 07:50:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 7 ms.
[2024-05-27 07:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8969388000668025622.gal : 3 ms
[2024-05-27 07:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12694932404523783462.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/CTLFireability8969388000668025622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12694932404523783462.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 : 437/437 places, 2155/2155 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 376 transition count 730
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 376 transition count 730
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 142 place count 376 transition count 710
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 216 place count 302 transition count 636
Iterating global reduction 1 with 74 rules applied. Total rules applied 290 place count 302 transition count 636
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 359 place count 302 transition count 567
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 467 place count 194 transition count 459
Iterating global reduction 2 with 108 rules applied. Total rules applied 575 place count 194 transition count 459
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 703 place count 194 transition count 331
Applied a total of 703 rules in 35 ms. Remains 194 /437 variables (removed 243) and now considering 331/2155 (removed 1824) transitions.
// Phase 1: matrix 331 rows 194 cols
[2024-05-27 07:51:16] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:51:16] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:51:16] [INFO ] Invariant cache hit.
[2024-05-27 07:51:16] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-27 07:51:17] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-27 07:51:17] [INFO ] Redundant transitions in 2 ms returned []
Running 330 sub problems to find dead transitions.
[2024-05-27 07:51:17] [INFO ] Invariant cache hit.
[2024-05-27 07:51:17] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (OVERLAPS) 331/525 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 150/347 constraints. Problems are: Problem set: 24 solved, 306 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 347 constraints, problems are : Problem set: 24 solved, 306 unsolved in 11920 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 17/186 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 3 (OVERLAPS) 8/194 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 5 (OVERLAPS) 331/525 variables, 194/197 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 150/347 constraints. Problems are: Problem set: 24 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 306/653 constraints. Problems are: Problem set: 24 solved, 306 unsolved
[2024-05-27 07:51:38] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:51:38] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:51:39] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-27 07:51:40] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-27 07:51:40] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:51:40] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-27 07:51:43] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
[2024-05-27 07:51:44] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 8/661 constraints. Problems are: Problem set: 46 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/661 constraints. Problems are: Problem set: 46 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 661 constraints, problems are : Problem set: 46 solved, 284 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 306/330 constraints, Known Traps: 8/8 constraints]
After SMT, in 42578ms problems are : Problem set: 46 solved, 284 unsolved
Search for dead transitions found 46 dead transitions in 42582ms
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 : 194/437 places, 285/2155 transitions.
Graph (complete) has 630 edges and 194 vertex of which 152 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 152 transition count 267
Applied a total of 19 rules in 9 ms. Remains 152 /194 variables (removed 42) and now considering 267/285 (removed 18) transitions.
// Phase 1: matrix 267 rows 152 cols
[2024-05-27 07:51:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:51:59] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 07:51:59] [INFO ] Invariant cache hit.
[2024-05-27 07:52:00] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-05-27 07:52:00] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 152/437 places, 267/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43780 ms. Remains : 152/437 places, 267/2155 transitions.
[2024-05-27 07:52:00] [INFO ] Flatten gal took : 15 ms
[2024-05-27 07:52:00] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:52:00] [INFO ] Input system was already deterministic with 267 transitions.
[2024-05-27 07:52:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:52:00] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:52:00] [INFO ] Time to serialize gal into /tmp/CTLFireability6478516166725493103.gal : 1 ms
[2024-05-27 07:52:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8812942447011975391.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/CTLFireability6478516166725493103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8812942447011975391.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,2.37233e+11,5.27203,148316,2,26004,5,396949,6,0,875,342041,0
Converting to forward existential form...Done !
original formula: EG(EF((EG(EF(((s1<1)||(l2782<1)))) * (((s1<1)||(l2621<1)) + (AF(((s1>=1)&&(l3920>=1))) * !(A(((s1>=1)&&(l3914>=1)) U ((s1>=1)&&(l3920>=1)...163
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EG(E(TRUE U ((s1<1)||(l2782<1)))) * (((s1<1)||(l2621<1)) + (!(EG(!(((s1>=1)&&(l3920>=1)))))...295
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27,...1016
Detected timeout of ITS tools.
[2024-05-27 07:52:30] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:52:30] [INFO ] Applying decomposition
[2024-05-27 07:52:30] [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/graph5656012300715362379.txt' '-o' '/tmp/graph5656012300715362379.bin' '-w' '/tmp/graph5656012300715362379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5656012300715362379.bin' '-l' '-1' '-v' '-w' '/tmp/graph5656012300715362379.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:52:30] [INFO ] Decomposing Gal with order
[2024-05-27 07:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:52:30] [INFO ] Removed a total of 271 redundant transitions.
[2024-05-27 07:52:30] [INFO ] Flatten gal took : 19 ms
[2024-05-27 07:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 6 ms.
[2024-05-27 07:52:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14500093343300983378.gal : 3 ms
[2024-05-27 07:52:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2929042719196273360.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/CTLFireability14500093343300983378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2929042719196273360.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 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1040
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1040
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 149 place count 382 transition count 1001
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 217 place count 314 transition count 933
Iterating global reduction 1 with 68 rules applied. Total rules applied 285 place count 314 transition count 933
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 420 place count 314 transition count 798
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 504 place count 230 transition count 714
Iterating global reduction 2 with 84 rules applied. Total rules applied 588 place count 230 transition count 714
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Iterating post reduction 2 with 244 rules applied. Total rules applied 832 place count 230 transition count 470
Applied a total of 832 rules in 27 ms. Remains 230 /437 variables (removed 207) and now considering 470/2155 (removed 1685) transitions.
// Phase 1: matrix 470 rows 230 cols
[2024-05-27 07:53:00] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:53:00] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-27 07:53:00] [INFO ] Invariant cache hit.
[2024-05-27 07:53:00] [INFO ] State equation strengthened by 259 read => feed constraints.
[2024-05-27 07:53:01] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2024-05-27 07:53:01] [INFO ] Invariant cache hit.
[2024-05-27 07:53:01] [INFO ] State equation strengthened by 259 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 4 (OVERLAPS) 470/700 variables, 230/233 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 259/492 constraints. Problems are: Problem set: 24 solved, 445 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/492 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/492 constraints. Problems are: Problem set: 24 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 492 constraints, problems are : Problem set: 24 solved, 445 unsolved in 25140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 17/222 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 8/230 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 470/700 variables, 230/233 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 259/492 constraints. Problems are: Problem set: 24 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 445/937 constraints. Problems are: Problem set: 24 solved, 445 unsolved
[2024-05-27 07:53:41] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-05-27 07:53:42] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 2 ms to minimize.
[2024-05-27 07:53:42] [INFO ] Deduced a trap composed of 106 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:53:44] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-05-27 07:53:44] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-05-27 07:53:45] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-05-27 07:53:51] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 7/944 constraints. Problems are: Problem set: 46 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 700/700 variables, and 944 constraints, problems are : Problem set: 46 solved, 423 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 230/230 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 445/469 constraints, Known Traps: 7/7 constraints]
After SMT, in 56302ms problems are : Problem set: 46 solved, 423 unsolved
Search for dead transitions found 46 dead transitions in 56308ms
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 : 230/437 places, 424/2155 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 188 transition count 406
Applied a total of 60 rules in 3 ms. Remains 188 /230 variables (removed 42) and now considering 406/424 (removed 18) transitions.
// Phase 1: matrix 406 rows 188 cols
[2024-05-27 07:53:57] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:53:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:53:57] [INFO ] Invariant cache hit.
[2024-05-27 07:53:57] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-27 07:53:58] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 188/437 places, 406/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57919 ms. Remains : 188/437 places, 406/2155 transitions.
[2024-05-27 07:53:58] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:53:58] [INFO ] Flatten gal took : 16 ms
[2024-05-27 07:53:58] [INFO ] Input system was already deterministic with 406 transitions.
[2024-05-27 07:53:58] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:53:58] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:53:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13853732660668737582.gal : 2 ms
[2024-05-27 07:53:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4370164481923099714.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/CTLFireability13853732660668737582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4370164481923099714.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 07:54:28] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:54:28] [INFO ] Applying decomposition
[2024-05-27 07:54:28] [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/graph5230672465358283638.txt' '-o' '/tmp/graph5230672465358283638.bin' '-w' '/tmp/graph5230672465358283638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5230672465358283638.bin' '-l' '-1' '-v' '-w' '/tmp/graph5230672465358283638.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:54:28] [INFO ] Decomposing Gal with order
[2024-05-27 07:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:54:28] [INFO ] Removed a total of 277 redundant transitions.
[2024-05-27 07:54:28] [INFO ] Flatten gal took : 20 ms
[2024-05-27 07:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 8 ms.
[2024-05-27 07:54:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5925653557745277508.gal : 2 ms
[2024-05-27 07:54:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6509146932141423103.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/CTLFireability5925653557745277508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6509146932141423103.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 : 437/437 places, 2155/2155 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 375 transition count 729
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 375 transition count 729
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 146 place count 375 transition count 707
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 220 place count 301 transition count 633
Iterating global reduction 1 with 74 rules applied. Total rules applied 294 place count 301 transition count 633
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 363 place count 301 transition count 564
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 471 place count 193 transition count 456
Iterating global reduction 2 with 108 rules applied. Total rules applied 579 place count 193 transition count 456
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 711 place count 193 transition count 324
Applied a total of 711 rules in 13 ms. Remains 193 /437 variables (removed 244) and now considering 324/2155 (removed 1831) transitions.
// Phase 1: matrix 324 rows 193 cols
[2024-05-27 07:54:58] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:54:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:54:58] [INFO ] Invariant cache hit.
[2024-05-27 07:54:58] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-05-27 07:54:59] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-27 07:54:59] [INFO ] Invariant cache hit.
[2024-05-27 07:54:59] [INFO ] State equation strengthened by 144 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 4 (OVERLAPS) 324/517 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 144/340 constraints. Problems are: Problem set: 24 solved, 299 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/340 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/340 constraints. Problems are: Problem set: 24 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 340 constraints, problems are : Problem set: 24 solved, 299 unsolved in 11535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 17/185 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 8/193 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 324/517 variables, 193/196 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 144/340 constraints. Problems are: Problem set: 24 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 299/639 constraints. Problems are: Problem set: 24 solved, 299 unsolved
[2024-05-27 07:55:19] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-05-27 07:55:19] [INFO ] Deduced a trap composed of 105 places in 57 ms of which 1 ms to minimize.
[2024-05-27 07:55:20] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-27 07:55:20] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-27 07:55:21] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
[2024-05-27 07:55:24] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 6/645 constraints. Problems are: Problem set: 46 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/645 constraints. Problems are: Problem set: 46 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 645 constraints, problems are : Problem set: 46 solved, 277 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 193/193 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 299/323 constraints, Known Traps: 6/6 constraints]
After SMT, in 42174ms problems are : Problem set: 46 solved, 277 unsolved
Search for dead transitions found 46 dead transitions in 42179ms
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 : 193/437 places, 278/2155 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 151 transition count 260
Applied a total of 60 rules in 2 ms. Remains 151 /193 variables (removed 42) and now considering 260/278 (removed 18) transitions.
// Phase 1: matrix 260 rows 151 cols
[2024-05-27 07:55:41] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:55:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 07:55:41] [INFO ] Invariant cache hit.
[2024-05-27 07:55:41] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-27 07:55:42] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/437 places, 260/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43291 ms. Remains : 151/437 places, 260/2155 transitions.
[2024-05-27 07:55:42] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:55:42] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:55:42] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-27 07:55:42] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:55:42] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:55:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12053635912108851271.gal : 2 ms
[2024-05-27 07:55:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14874458787576875873.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/CTLFireability12053635912108851271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14874458787576875873.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,2.16202e+11,6.69845,174440,2,28774,5,499840,6,0,864,429502,0
Converting to forward existential form...Done !
original formula: EG(AX((((s1>=1)&&(l192>=1)) + (AF(((s1<1)||(l3076<1))) * (AG(((s1>=1)&&(l3916>=1))) + AF(((s1>=1)&&(l3925>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((s1>=1)&&(l192>=1)) + (!(EG(!(((s1<1)||(l3076<1))))) * (!(E(TRUE U !(((s1>=1)&&(l3916>=1))))...207
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31,...979
Detected timeout of ITS tools.
[2024-05-27 07:56:12] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:56:12] [INFO ] Applying decomposition
[2024-05-27 07:56:12] [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/graph12131409928752010287.txt' '-o' '/tmp/graph12131409928752010287.bin' '-w' '/tmp/graph12131409928752010287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12131409928752010287.bin' '-l' '-1' '-v' '-w' '/tmp/graph12131409928752010287.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:56:12] [INFO ] Decomposing Gal with order
[2024-05-27 07:56:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:56:12] [INFO ] Removed a total of 264 redundant transitions.
[2024-05-27 07:56:12] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:56:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 8 ms.
[2024-05-27 07:56:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6670153994077834396.gal : 2 ms
[2024-05-27 07:56:12] [INFO ] Time to serialize properties into /tmp/CTLFireability604753432983293638.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/CTLFireability6670153994077834396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability604753432983293638.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 -...261
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 : 437/437 places, 2155/2155 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 376 transition count 781
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 376 transition count 781
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 149 place count 376 transition count 754
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 221 place count 304 transition count 682
Iterating global reduction 1 with 72 rules applied. Total rules applied 293 place count 304 transition count 682
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 372 place count 304 transition count 603
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 476 place count 200 transition count 499
Iterating global reduction 2 with 104 rules applied. Total rules applied 580 place count 200 transition count 499
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 720 place count 200 transition count 359
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 721 place count 199 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 722 place count 199 transition count 346
Applied a total of 722 rules in 33 ms. Remains 199 /437 variables (removed 238) and now considering 346/2155 (removed 1809) transitions.
// Phase 1: matrix 346 rows 199 cols
[2024-05-27 07:56:42] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 07:56:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-27 07:56:42] [INFO ] Invariant cache hit.
[2024-05-27 07:56:42] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 07:56:43] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-27 07:56:43] [INFO ] Redundant transitions in 3 ms returned []
Running 345 sub problems to find dead transitions.
[2024-05-27 07:56:43] [INFO ] Invariant cache hit.
[2024-05-27 07:56:43] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 4 (OVERLAPS) 346/545 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 160/362 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/362 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/362 constraints. Problems are: Problem set: 24 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 362 constraints, problems are : Problem set: 24 solved, 321 unsolved in 13895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 17/191 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 8/199 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 346/545 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 160/362 constraints. Problems are: Problem set: 24 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 321/683 constraints. Problems are: Problem set: 24 solved, 321 unsolved
[2024-05-27 07:57:07] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:57:07] [INFO ] Deduced a trap composed of 106 places in 50 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-27 07:57:08] [INFO ] Deduced a trap composed of 97 places in 45 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 07:57:08] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
[2024-05-27 07:57:12] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
[2024-05-27 07:57:13] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:57:13] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 7/690 constraints. Problems are: Problem set: 46 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/690 constraints. Problems are: Problem set: 46 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 690 constraints, problems are : Problem set: 46 solved, 299 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 321/345 constraints, Known Traps: 7/7 constraints]
After SMT, in 44605ms problems are : Problem set: 46 solved, 299 unsolved
Search for dead transitions found 46 dead transitions in 44610ms
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 : 199/437 places, 300/2155 transitions.
Graph (complete) has 656 edges and 199 vertex of which 157 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 157 transition count 282
Applied a total of 19 rules in 9 ms. Remains 157 /199 variables (removed 42) and now considering 282/300 (removed 18) transitions.
// Phase 1: matrix 282 rows 157 cols
[2024-05-27 07:57:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:57:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:57:27] [INFO ] Invariant cache hit.
[2024-05-27 07:57:27] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-27 07:57:28] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 157/437 places, 282/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45838 ms. Remains : 157/437 places, 282/2155 transitions.
[2024-05-27 07:57:28] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:57:28] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:57:28] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-27 07:57:28] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:57:28] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9406798710569154194.gal : 1 ms
[2024-05-27 07:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4676768232172331376.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/CTLFireability9406798710569154194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4676768232172331376.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,2.33802e+11,5.85056,156896,2,27924,5,439410,6,0,910,365004,0
Converting to forward existential form...Done !
original formula: EG((E(AG(!(A(((s1>=1)&&(l3910>=1)) U !(((s1<1)||(l3908<1)))))) U ((s1>=1)&&(l3938>=1))) + ((p785>=1)&&(l0>=1))))
=> equivalent forward existential formula: [FwdG(Init,(E(!(E(TRUE U !(!(!((E(!(!(((s1<1)||(l3908<1)))) U (!(((s1>=1)&&(l3910>=1))) * !(!(((s1<1)||(l3908<1)...258
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t35, t36, t37, t38, t39,...1022
Detected timeout of ITS tools.
[2024-05-27 07:57:58] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:57:58] [INFO ] Applying decomposition
[2024-05-27 07:57:58] [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/graph13059526950930620736.txt' '-o' '/tmp/graph13059526950930620736.bin' '-w' '/tmp/graph13059526950930620736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13059526950930620736.bin' '-l' '-1' '-v' '-w' '/tmp/graph13059526950930620736.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:57:58] [INFO ] Decomposing Gal with order
[2024-05-27 07:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:57:58] [INFO ] Removed a total of 251 redundant transitions.
[2024-05-27 07:57:58] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:57:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 4 ms.
[2024-05-27 07:57:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6437940263176208137.gal : 2 ms
[2024-05-27 07:57:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11363898305194117549.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/CTLFireability6437940263176208137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11363898305194117549.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 : 437/437 places, 2155/2155 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 385 transition count 1091
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 385 transition count 1091
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 145 place count 385 transition count 1050
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 210 place count 320 transition count 985
Iterating global reduction 1 with 65 rules applied. Total rules applied 275 place count 320 transition count 985
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 419 place count 320 transition count 841
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 499 place count 240 transition count 761
Iterating global reduction 2 with 80 rules applied. Total rules applied 579 place count 240 transition count 761
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 2 with 228 rules applied. Total rules applied 807 place count 240 transition count 533
Applied a total of 807 rules in 52 ms. Remains 240 /437 variables (removed 197) and now considering 533/2155 (removed 1622) transitions.
// Phase 1: matrix 533 rows 240 cols
[2024-05-27 07:58:28] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 07:58:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 07:58:28] [INFO ] Invariant cache hit.
[2024-05-27 07:58:28] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-27 07:58:29] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2024-05-27 07:58:29] [INFO ] Redundant transitions in 8 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-27 07:58:29] [INFO ] Invariant cache hit.
[2024-05-27 07:58:29] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (OVERLAPS) 1/240 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
At refinement iteration 4 (OVERLAPS) 533/773 variables, 240/243 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 313/556 constraints. Problems are: Problem set: 24 solved, 508 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 0/556 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 0/773 variables, 0/556 constraints. Problems are: Problem set: 24 solved, 508 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 556 constraints, problems are : Problem set: 24 solved, 508 unsolved in 29302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 17/232 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 8/240 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 533/773 variables, 240/243 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 313/556 constraints. Problems are: Problem set: 24 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 508/1064 constraints. Problems are: Problem set: 24 solved, 508 unsolved
[2024-05-27 07:59:22] [INFO ] Deduced a trap composed of 106 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:59:24] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
[2024-05-27 07:59:24] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 1067 constraints, problems are : Problem set: 36 solved, 496 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 508/532 constraints, Known Traps: 3/3 constraints]
After SMT, in 60693ms problems are : Problem set: 36 solved, 496 unsolved
Search for dead transitions found 36 dead transitions in 60698ms
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 SI_CTL mode, iteration 1 : 240/437 places, 497/2155 transitions.
Graph (complete) has 947 edges and 240 vertex of which 208 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 208 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 204 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 204 transition count 481
Applied a total of 21 rules in 29 ms. Remains 204 /240 variables (removed 36) and now considering 481/497 (removed 16) transitions.
// Phase 1: matrix 481 rows 204 cols
[2024-05-27 07:59:30] [INFO ] Computed 1 invariants in 5 ms
[2024-05-27 07:59:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-27 07:59:30] [INFO ] Invariant cache hit.
[2024-05-27 07:59:30] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-27 07:59:30] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 204/437 places, 481/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 62604 ms. Remains : 204/437 places, 481/2155 transitions.
[2024-05-27 07:59:30] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:59:30] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:59:30] [INFO ] Input system was already deterministic with 481 transitions.
[2024-05-27 07:59:30] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:59:30] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:59:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15123249617448074664.gal : 2 ms
[2024-05-27 07:59:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11372476352061679180.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/CTLFireability15123249617448074664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11372476352061679180.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:00:01] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:00:01] [INFO ] Applying decomposition
[2024-05-27 08:00:01] [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/graph12710536589776771023.txt' '-o' '/tmp/graph12710536589776771023.bin' '-w' '/tmp/graph12710536589776771023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12710536589776771023.bin' '-l' '-1' '-v' '-w' '/tmp/graph12710536589776771023.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:00:01] [INFO ] Decomposing Gal with order
[2024-05-27 08:00:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:00:01] [INFO ] Removed a total of 455 redundant transitions.
[2024-05-27 08:00:01] [INFO ] Flatten gal took : 24 ms
[2024-05-27 08:00:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 8 ms.
[2024-05-27 08:00:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15270160984115181103.gal : 2 ms
[2024-05-27 08:00:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2781713941240484706.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/CTLFireability15270160984115181103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2781713941240484706.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 : 437/437 places, 2155/2155 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 374 transition count 729
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 374 transition count 729
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 150 place count 374 transition count 705
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 224 place count 300 transition count 631
Iterating global reduction 1 with 74 rules applied. Total rules applied 298 place count 300 transition count 631
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 367 place count 300 transition count 562
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 475 place count 192 transition count 454
Iterating global reduction 2 with 108 rules applied. Total rules applied 583 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 719 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 720 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 721 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 722 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 723 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 727 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 731 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 751 place count 186 transition count 280
Applied a total of 751 rules in 37 ms. Remains 186 /437 variables (removed 251) and now considering 280/2155 (removed 1875) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 08:00:31] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 08:00:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 08:00:31] [INFO ] Invariant cache hit.
[2024-05-27 08:00:31] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 08:00:31] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-27 08:00:31] [INFO ] Redundant transitions in 4 ms returned []
Running 279 sub problems to find dead transitions.
[2024-05-27 08:00:31] [INFO ] Invariant cache hit.
[2024-05-27 08:00:31] [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
[2024-05-27 08:00:41] [INFO ] Deduced a trap composed of 89 places in 50 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:00:41] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:00:41] [INFO ] Deduced a trap composed of 107 places in 59 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 TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/466 variables, 3/298 constraints. Problems are: Problem set: 44 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/298 constraints. Problems are: Problem set: 44 solved, 235 unsolved
[2024-05-27 08:00:45] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-27 08:00:45] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/466 variables, 2/300 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:00:49] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/301 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:00:52] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2024-05-27 08:00:52] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/303 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/303 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 0/466 variables, 0/303 constraints. Problems are: Problem set: 46 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 303 constraints, problems are : Problem set: 46 solved, 233 unsolved in 27911 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: 8/8 constraints]
Escalating to Integer solving :Problem set: 46 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 27/170 variables, 2/2 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/3 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 16/186 variables, 1/4 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 7/11 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 280/466 variables, 186/197 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 106/303 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 233/536 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/536 constraints. Problems are: Problem set: 46 solved, 233 unsolved
[2024-05-27 08:01:16] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-05-27 08:01:18] [INFO ] Deduced a trap composed of 94 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/466 variables, 2/538 constraints. Problems are: Problem set: 46 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/538 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 538 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: 233/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 58404ms problems are : Problem set: 46 solved, 233 unsolved
Search for dead transitions found 46 dead transitions in 58407ms
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/437 places, 234/2155 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.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 144 transition count 216
Applied a total of 19 rules in 6 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:01:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 08:01:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 08:01:30] [INFO ] Invariant cache hit.
[2024-05-27 08:01:30] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 08:01:30] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 144/437 places, 216/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 59442 ms. Remains : 144/437 places, 216/2155 transitions.
[2024-05-27 08:01:30] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:01:30] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-27 08:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-27 08:01:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13447010541003439154.gal : 1 ms
[2024-05-27 08:01:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11468496117855385483.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/CTLFireability13447010541003439154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11468496117855385483.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,1.81002e+11,2.42767,70624,2,16654,5,261080,6,0,792,221657,0
Converting to forward existential form...Done !
original formula: AG((AF(((s1>=1)&&(l3927>=1))) + ((s1>=1)&&(l3933>=1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((s1>=1)&&(l3933>=1)))),!(((s1>=1)&&(l3927>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 9/0/207
(forward)formula 0,0,22.1259,480176,1,0,115,2.04433e+06,22,6,4316,1.67298e+06,112
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 838
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 838
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 138 place count 382 transition count 810
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 177 place count 343 transition count 771
Iterating global reduction 1 with 39 rules applied. Total rules applied 216 place count 343 transition count 771
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 238 place count 343 transition count 749
Discarding 125 places :
Symmetric choice reduction at 2 with 125 rule applications. Total rules 363 place count 218 transition count 624
Iterating global reduction 2 with 125 rules applied. Total rules applied 488 place count 218 transition count 624
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 688 place count 218 transition count 424
Applied a total of 688 rules in 22 ms. Remains 218 /437 variables (removed 219) and now considering 424/2155 (removed 1731) transitions.
// Phase 1: matrix 424 rows 218 cols
[2024-05-27 08:01:52] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 08:01:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 08:01:53] [INFO ] Invariant cache hit.
[2024-05-27 08:01:53] [INFO ] State equation strengthened by 223 read => feed constraints.
[2024-05-27 08:01:53] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-05-27 08:01:53] [INFO ] Invariant cache hit.
[2024-05-27 08:01:53] [INFO ] State equation strengthened by 223 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/218 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 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/642 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 223/444 constraints. Problems are: Problem set: 24 solved, 399 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/444 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/444 constraints. Problems are: Problem set: 24 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 444 constraints, problems are : Problem set: 24 solved, 399 unsolved in 19341 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 223/223 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/193 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 17/210 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 8/218 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 5 (OVERLAPS) 424/642 variables, 218/221 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 223/444 constraints. Problems are: Problem set: 24 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 399/843 constraints. Problems are: Problem set: 24 solved, 399 unsolved
[2024-05-27 08:02:29] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
[2024-05-27 08:02:30] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-05-27 08:02:30] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
[2024-05-27 08:02:36] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2024-05-27 08:02:36] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
[2024-05-27 08:02:36] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
[2024-05-27 08:02:36] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-05-27 08:02:37] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 8/851 constraints. Problems are: Problem set: 46 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 851 constraints, problems are : Problem set: 46 solved, 377 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 223/223 constraints, PredecessorRefiner: 399/423 constraints, Known Traps: 8/8 constraints]
After SMT, in 50347ms problems are : Problem set: 46 solved, 377 unsolved
Search for dead transitions found 46 dead transitions in 50353ms
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 : 218/437 places, 378/2155 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 176 transition count 360
Applied a total of 60 rules in 3 ms. Remains 176 /218 variables (removed 42) and now considering 360/378 (removed 18) transitions.
// Phase 1: matrix 360 rows 176 cols
[2024-05-27 08:02:44] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:02:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 08:02:44] [INFO ] Invariant cache hit.
[2024-05-27 08:02:44] [INFO ] State equation strengthened by 215 read => feed constraints.
[2024-05-27 08:02:44] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/437 places, 360/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51704 ms. Remains : 176/437 places, 360/2155 transitions.
[2024-05-27 08:02:44] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:02:44] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:02:44] [INFO ] Input system was already deterministic with 360 transitions.
[2024-05-27 08:02:44] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:02:44] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:02:44] [INFO ] Time to serialize gal into /tmp/CTLFireability15859894233005535477.gal : 2 ms
[2024-05-27 08:02:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18362122996774765060.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/CTLFireability15859894233005535477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18362122996774765060.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:03:14] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:03:14] [INFO ] Applying decomposition
[2024-05-27 08:03:14] [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/graph12465840632231609675.txt' '-o' '/tmp/graph12465840632231609675.bin' '-w' '/tmp/graph12465840632231609675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12465840632231609675.bin' '-l' '-1' '-v' '-w' '/tmp/graph12465840632231609675.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:03:14] [INFO ] Decomposing Gal with order
[2024-05-27 08:03:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:03:14] [INFO ] Removed a total of 391 redundant transitions.
[2024-05-27 08:03:14] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:03:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 3 ms.
[2024-05-27 08:03:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8388669986043209299.gal : 3 ms
[2024-05-27 08:03:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12392796813175839306.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/CTLFireability8388669986043209299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12392796813175839306.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 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1088
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1088
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 156 place count 382 transition count 1042
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 222 place count 316 transition count 976
Iterating global reduction 1 with 66 rules applied. Total rules applied 288 place count 316 transition count 976
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 434 place count 316 transition count 830
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 514 place count 236 transition count 750
Iterating global reduction 2 with 80 rules applied. Total rules applied 594 place count 236 transition count 750
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 762 place count 236 transition count 582
Applied a total of 762 rules in 15 ms. Remains 236 /437 variables (removed 201) and now considering 582/2155 (removed 1573) transitions.
// Phase 1: matrix 582 rows 236 cols
[2024-05-27 08:03:44] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:03:45] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 08:03:45] [INFO ] Invariant cache hit.
[2024-05-27 08:03:45] [INFO ] State equation strengthened by 367 read => feed constraints.
[2024-05-27 08:03:46] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-27 08:03:46] [INFO ] Invariant cache hit.
[2024-05-27 08:03:46] [INFO ] State equation strengthened by 367 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
At refinement iteration 4 (OVERLAPS) 582/818 variables, 236/239 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 367/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 606 constraints, problems are : Problem set: 24 solved, 557 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 17/228 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 3 (OVERLAPS) 8/236 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 582/818 variables, 236/239 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 367/606 constraints. Problems are: Problem set: 24 solved, 557 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/818 variables, 557/1163 constraints. Problems are: Problem set: 24 solved, 557 unsolved
[2024-05-27 08:04:42] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 2 ms to minimize.
[2024-05-27 08:04:43] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
[2024-05-27 08:04:44] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 1166 constraints, problems are : Problem set: 36 solved, 545 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 557/581 constraints, Known Traps: 3/3 constraints]
After SMT, in 61659ms problems are : Problem set: 36 solved, 545 unsolved
Search for dead transitions found 36 dead transitions in 61669ms
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 : 236/437 places, 546/2155 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 204 transition count 534
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 200 transition count 530
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 200 transition count 530
Applied a total of 52 rules in 5 ms. Remains 200 /236 variables (removed 36) and now considering 530/546 (removed 16) transitions.
// Phase 1: matrix 530 rows 200 cols
[2024-05-27 08:04:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-27 08:04:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 08:04:47] [INFO ] Invariant cache hit.
[2024-05-27 08:04:48] [INFO ] State equation strengthened by 359 read => feed constraints.
[2024-05-27 08:04:48] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 200/437 places, 530/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63864 ms. Remains : 200/437 places, 530/2155 transitions.
[2024-05-27 08:04:48] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:04:48] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:04:48] [INFO ] Input system was already deterministic with 530 transitions.
[2024-05-27 08:04:48] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:04:48] [INFO ] Flatten gal took : 12 ms
[2024-05-27 08:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2569652989491152348.gal : 2 ms
[2024-05-27 08:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5630036196365241499.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/CTLFireability2569652989491152348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5630036196365241499.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:05:18] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:05:18] [INFO ] Applying decomposition
[2024-05-27 08:05:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6427793502377935880.txt' '-o' '/tmp/graph6427793502377935880.bin' '-w' '/tmp/graph6427793502377935880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6427793502377935880.bin' '-l' '-1' '-v' '-w' '/tmp/graph6427793502377935880.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:05:18] [INFO ] Decomposing Gal with order
[2024-05-27 08:05:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:05:18] [INFO ] Removed a total of 669 redundant transitions.
[2024-05-27 08:05:18] [INFO ] Flatten gal took : 50 ms
[2024-05-27 08:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 370 labels/synchronizations in 5 ms.
[2024-05-27 08:05:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12663287866065783109.gal : 3 ms
[2024-05-27 08:05:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16628880826123280150.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/CTLFireability12663287866065783109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16628880826123280150.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 377 transition count 830
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 377 transition count 830
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 148 place count 377 transition count 802
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 219 place count 306 transition count 731
Iterating global reduction 1 with 71 rules applied. Total rules applied 290 place count 306 transition count 731
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 380 place count 306 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 480 place count 206 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 580 place count 206 transition count 541
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 724 place count 206 transition count 397
Applied a total of 724 rules in 36 ms. Remains 206 /437 variables (removed 231) and now considering 397/2155 (removed 1758) transitions.
// Phase 1: matrix 397 rows 206 cols
[2024-05-27 08:05:49] [INFO ] Computed 3 invariants in 8 ms
[2024-05-27 08:05:49] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-27 08:05:49] [INFO ] Invariant cache hit.
[2024-05-27 08:05:49] [INFO ] State equation strengthened by 206 read => feed constraints.
[2024-05-27 08:05:49] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2024-05-27 08:05:49] [INFO ] Redundant transitions in 5 ms returned []
Running 396 sub problems to find dead transitions.
[2024-05-27 08:05:49] [INFO ] Invariant cache hit.
[2024-05-27 08:05:49] [INFO ] State equation strengthened by 206 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 4 (OVERLAPS) 397/603 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 206/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 0/603 variables, 0/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 415 constraints, problems are : Problem set: 24 solved, 372 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 397/603 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 206/415 constraints. Problems are: Problem set: 24 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 372/787 constraints. Problems are: Problem set: 24 solved, 372 unsolved
[2024-05-27 08:06:23] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-27 08:06:23] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
[2024-05-27 08:06:24] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
[2024-05-27 08:06:29] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
[2024-05-27 08:06:30] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2024-05-27 08:06:30] [INFO ] Deduced a trap composed of 94 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 6/793 constraints. Problems are: Problem set: 46 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/603 variables, and 793 constraints, problems are : Problem set: 46 solved, 350 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 206/206 constraints, PredecessorRefiner: 372/396 constraints, Known Traps: 6/6 constraints]
After SMT, in 50928ms problems are : Problem set: 46 solved, 350 unsolved
Search for dead transitions found 46 dead transitions in 50932ms
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 : 206/437 places, 351/2155 transitions.
Graph (complete) has 718 edges and 206 vertex of which 164 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 164 transition count 333
Applied a total of 19 rules in 10 ms. Remains 164 /206 variables (removed 42) and now considering 333/351 (removed 18) transitions.
// Phase 1: matrix 333 rows 164 cols
[2024-05-27 08:06:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:06:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 08:06:40] [INFO ] Invariant cache hit.
[2024-05-27 08:06:41] [INFO ] State equation strengthened by 198 read => feed constraints.
[2024-05-27 08:06:41] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 164/437 places, 333/2155 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 52346 ms. Remains : 164/437 places, 333/2155 transitions.
[2024-05-27 08:06:41] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:06:41] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:06:41] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-27 08:06:41] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:06:41] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:06:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17521357306680008043.gal : 2 ms
[2024-05-27 08:06:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17514396854729040752.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/CTLFireability17521357306680008043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17514396854729040752.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:07:11] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:07:11] [INFO ] Applying decomposition
[2024-05-27 08:07:11] [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/graph3032695903368374920.txt' '-o' '/tmp/graph3032695903368374920.bin' '-w' '/tmp/graph3032695903368374920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3032695903368374920.bin' '-l' '-1' '-v' '-w' '/tmp/graph3032695903368374920.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:07:11] [INFO ] Decomposing Gal with order
[2024-05-27 08:07:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:07:11] [INFO ] Removed a total of 259 redundant transitions.
[2024-05-27 08:07:11] [INFO ] Flatten gal took : 18 ms
[2024-05-27 08:07:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 10 ms.
[2024-05-27 08:07:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10505052260080166508.gal : 4 ms
[2024-05-27 08:07:11] [INFO ] Time to serialize properties into /tmp/CTLFireability529354293641175756.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/CTLFireability10505052260080166508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability529354293641175756.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 : 437/437 places, 2155/2155 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 377 transition count 831
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 377 transition count 831
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 147 place count 377 transition count 804
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 219 place count 305 transition count 732
Iterating global reduction 1 with 72 rules applied. Total rules applied 291 place count 305 transition count 732
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 382 place count 305 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 482 place count 205 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 582 place count 205 transition count 541
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 730 place count 205 transition count 393
Applied a total of 730 rules in 21 ms. Remains 205 /437 variables (removed 232) and now considering 393/2155 (removed 1762) transitions.
// Phase 1: matrix 393 rows 205 cols
[2024-05-27 08:07:41] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 08:07:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 08:07:41] [INFO ] Invariant cache hit.
[2024-05-27 08:07:41] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-05-27 08:07:42] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-27 08:07:42] [INFO ] Invariant cache hit.
[2024-05-27 08:07:42] [INFO ] State equation strengthened by 203 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (OVERLAPS) 393/598 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 203/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 0/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/598 variables, 0/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 411 constraints, problems are : Problem set: 24 solved, 368 unsolved in 16646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 17/197 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 8/205 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 393/598 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 203/411 constraints. Problems are: Problem set: 24 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 368/779 constraints. Problems are: Problem set: 24 solved, 368 unsolved
[2024-05-27 08:08:12] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
[2024-05-27 08:08:12] [INFO ] Deduced a trap composed of 106 places in 54 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-27 08:08:13] [INFO ] Deduced a trap composed of 97 places in 37 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-27 08:08:13] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-05-27 08:08:19] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
[2024-05-27 08:08:19] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 2 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
[2024-05-27 08:08:20] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-05-27 08:08:20] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 8/787 constraints. Problems are: Problem set: 46 solved, 346 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 787 constraints, problems are : Problem set: 46 solved, 346 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 368/392 constraints, Known Traps: 8/8 constraints]
After SMT, in 47507ms problems are : Problem set: 46 solved, 346 unsolved
Search for dead transitions found 46 dead transitions in 47511ms
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 : 205/437 places, 347/2155 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 163 transition count 329
Applied a total of 60 rules in 2 ms. Remains 163 /205 variables (removed 42) and now considering 329/347 (removed 18) transitions.
// Phase 1: matrix 329 rows 163 cols
[2024-05-27 08:08:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 08:08:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 08:08:30] [INFO ] Invariant cache hit.
[2024-05-27 08:08:30] [INFO ] State equation strengthened by 195 read => feed constraints.
[2024-05-27 08:08:30] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/437 places, 329/2155 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48968 ms. Remains : 163/437 places, 329/2155 transitions.
[2024-05-27 08:08:30] [INFO ] Flatten gal took : 11 ms
[2024-05-27 08:08:30] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:08:30] [INFO ] Input system was already deterministic with 329 transitions.
[2024-05-27 08:08:30] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:08:30] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13744375630224433640.gal : 1 ms
[2024-05-27 08:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1621310490840535470.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/CTLFireability13744375630224433640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1621310490840535470.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:09:00] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:09:00] [INFO ] Applying decomposition
[2024-05-27 08:09:00] [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/graph2829897580584233759.txt' '-o' '/tmp/graph2829897580584233759.bin' '-w' '/tmp/graph2829897580584233759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2829897580584233759.bin' '-l' '-1' '-v' '-w' '/tmp/graph2829897580584233759.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:09:00] [INFO ] Decomposing Gal with order
[2024-05-27 08:09:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:09:00] [INFO ] Removed a total of 311 redundant transitions.
[2024-05-27 08:09:00] [INFO ] Flatten gal took : 16 ms
[2024-05-27 08:09:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 3 ms.
[2024-05-27 08:09:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4032856510444193901.gal : 3 ms
[2024-05-27 08:09:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5950035165260778641.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/CTLFireability4032856510444193901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5950035165260778641.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.
[2024-05-27 08:09:30] [INFO ] Flatten gal took : 44 ms
[2024-05-27 08:09:30] [INFO ] Flatten gal took : 45 ms
[2024-05-27 08:09:30] [INFO ] Applying decomposition
[2024-05-27 08:09:31] [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/graph14114234560730280688.txt' '-o' '/tmp/graph14114234560730280688.bin' '-w' '/tmp/graph14114234560730280688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14114234560730280688.bin' '-l' '-1' '-v' '-w' '/tmp/graph14114234560730280688.weights' '-q' '0' '-e' '0.001'
[2024-05-27 08:09:31] [INFO ] Decomposing Gal with order
[2024-05-27 08:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 08:09:31] [INFO ] Removed a total of 1606 redundant transitions.
[2024-05-27 08:09:31] [INFO ] Flatten gal took : 320 ms
[2024-05-27 08:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1604 labels/synchronizations in 32 ms.
[2024-05-27 08:09:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15978090911414940110.gal : 8 ms
[2024-05-27 08:09:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5972547283016159374.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/CTLFireability15978090911414940110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5972547283016159374.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 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-27 08:15:45] [INFO ] Flatten gal took : 45 ms
[2024-05-27 08:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13339281201274248305.gal : 7 ms
[2024-05-27 08:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11337145147156275421.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/CTLFireability13339281201274248305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11337145147156275421.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 11 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,1.29219e+12,278.288,6009052,2,57567,5,8.45302e+06,6,0,3903,4.38352e+06,0
Converting to forward existential form...Done !
original formula: EG((((A(((s1>=1)&&(l3915>=1)) U ((s1>=1)&&(l3926>=1))) + EG(((s1>=1)&&(l3938>=1)))) + (EF(((s1<1)||(l3908<1))) + AG(((s1>=1)&&(l3928>=1))...336
=> equivalent forward existential formula: [FwdG(Init,(((!((E(!(((s1>=1)&&(l3926>=1))) U (!(((s1>=1)&&(l3915>=1))) * !(((s1>=1)&&(l3926>=1))))) + EG(!(((s1...468
Reverse transition relation is NOT exact ! Due to transitions t1, t61, t62, t63, t64, t65, t98, t99, t100, t101, t102, t113, t114, t115, t116, t117, t207, ...11159
ITS-tools command line returned an error code 137
[2024-05-27 08:24:51] [INFO ] Flatten gal took : 49 ms
[2024-05-27 08:24:52] [INFO ] Input system was already deterministic with 2155 transitions.
[2024-05-27 08:24:52] [INFO ] Transformed 437 places.
[2024-05-27 08:24:52] [INFO ] Transformed 2155 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:24:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3700867021667843689.gal : 10 ms
[2024-05-27 08:24:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4947872826588951117.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/CTLFireability3700867021667843689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4947872826588951117.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m020"
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-d1m020, 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-171679079500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 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 ;