About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d2m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15671.647 | 3600000.00 | 3806296.00 | 8189.40 | ??????TT?F???FT? | 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.r378-smll-171683810800114.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 SieveSingleMsgMbox-PT-d2m18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716931542263
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 21:25:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:25:44] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2024-05-28 21:25:44] [INFO ] Transformed 2398 places.
[2024-05-28 21:25:44] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:25:44] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 115 ms.
Deduced a syphon composed of 1984 places in 23 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 58 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 933 place count 309 transition count 905
Iterating global reduction 1 with 80 rules applied. Total rules applied 1013 place count 309 transition count 905
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1029 place count 309 transition count 889
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1082 place count 256 transition count 836
Iterating global reduction 2 with 53 rules applied. Total rules applied 1135 place count 256 transition count 836
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1171 place count 256 transition count 800
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1190 place count 237 transition count 777
Iterating global reduction 3 with 19 rules applied. Total rules applied 1209 place count 237 transition count 777
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 1307 place count 237 transition count 679
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1310 place count 234 transition count 673
Iterating global reduction 4 with 3 rules applied. Total rules applied 1313 place count 234 transition count 673
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1316 place count 231 transition count 670
Iterating global reduction 4 with 3 rules applied. Total rules applied 1319 place count 231 transition count 670
Applied a total of 1319 rules in 160 ms. Remains 231 /414 variables (removed 183) and now considering 670/1954 (removed 1284) transitions.
// Phase 1: matrix 670 rows 231 cols
[2024-05-28 21:25:45] [INFO ] Computed 5 invariants in 38 ms
[2024-05-28 21:25:45] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-28 21:25:45] [INFO ] Invariant cache hit.
[2024-05-28 21:25:45] [INFO ] State equation strengthened by 499 read => feed constraints.
[2024-05-28 21:25:47] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
Running 669 sub problems to find dead transitions.
[2024-05-28 21:25:47] [INFO ] Invariant cache hit.
[2024-05-28 21:25:47] [INFO ] State equation strengthened by 499 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-28 21:26:08] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 26 ms to minimize.
[2024-05-28 21:26:08] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 669 unsolved
SMT process timed out in 32699ms, After SMT, problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 32736ms
Starting structural reductions in LTL mode, iteration 1 : 231/414 places, 670/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35182 ms. Remains : 231/414 places, 670/1954 transitions.
Support contains 58 out of 231 places after structural reductions.
[2024-05-28 21:26:20] [INFO ] Flatten gal took : 113 ms
[2024-05-28 21:26:20] [INFO ] Flatten gal took : 68 ms
[2024-05-28 21:26:20] [INFO ] Input system was already deterministic with 670 transitions.
Reduction of identical properties reduced properties to check from 52 to 50
RANDOM walk for 40000 steps (8936 resets) in 5043 ms. (7 steps per ms) remains 48/50 properties
BEST_FIRST walk for 4002 steps (168 resets) in 92 ms. (43 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (194 resets) in 139 ms. (28 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (197 resets) in 100 ms. (39 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (205 resets) in 107 ms. (37 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (180 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (204 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (192 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (197 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (199 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (180 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (177 resets) in 48 ms. (81 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (170 resets) in 51 ms. (76 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (187 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (167 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (192 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (190 resets) in 48 ms. (81 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (180 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (199 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (179 resets) in 64 ms. (61 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (194 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (176 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (186 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (171 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (177 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (178 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (195 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (203 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (189 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (198 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (204 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (199 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (191 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (197 resets) in 66 ms. (59 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (183 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (194 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (450 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (176 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (395 resets) in 59 ms. (66 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (168 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (200 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (198 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (193 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (193 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (191 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (194 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (211 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (425 resets) in 96 ms. (41 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (208 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 217935 steps, run timeout after 6001 ms. (steps per millisecond=36 ) properties seen :28 out of 48
Probabilistic random walk after 217935 steps, saw 104556 distinct states, run finished after 6015 ms. (steps per millisecond=36 ) properties seen :28
[2024-05-28 21:26:29] [INFO ] Invariant cache hit.
[2024-05-28 21:26:29] [INFO ] State equation strengthened by 499 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 108/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 57/194 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 5 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 482/676 variables, 194/202 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 311/513 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp48 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 225/901 variables, 37/550 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 188/738 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 0/738 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/901 variables, 0/738 constraints. Problems are: Problem set: 4 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 901/901 variables, and 738 constraints, problems are : Problem set: 4 solved, 16 unsolved in 3535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 231/231 constraints, ReadFeed: 499/499 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 4 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 110/128 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 57/185 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 3/8 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 356/541 variables, 185/193 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 185/378 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 1/379 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/379 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 360/901 variables, 46/425 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/901 variables, 314/739 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 15/754 constraints. Problems are: Problem set: 4 solved, 16 unsolved
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 7 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/901 variables, and 758 constraints, problems are : Problem set: 4 solved, 16 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 231/231 constraints, ReadFeed: 499/499 constraints, PredecessorRefiner: 16/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 8689ms problems are : Problem set: 4 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 670/670 transitions.
Graph (complete) has 1020 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 230 transition count 668
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 202 transition count 366
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 202 transition count 366
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 72 place count 202 transition count 353
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 97 place count 177 transition count 328
Iterating global reduction 2 with 25 rules applied. Total rules applied 122 place count 177 transition count 328
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 177 transition count 321
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 169 transition count 308
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 169 transition count 308
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 149 place count 169 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 168 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 168 transition count 303
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 167 transition count 302
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 167 transition count 302
Applied a total of 153 rules in 96 ms. Remains 167 /231 variables (removed 64) and now considering 302/670 (removed 368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 167/231 places, 302/670 transitions.
RANDOM walk for 40000 steps (9000 resets) in 559 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (186 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (174 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (180 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (190 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (185 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (188 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (179 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (178 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (182 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (176 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (176 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (437 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (201 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (200 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 227938 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :1 out of 16
Probabilistic random walk after 227938 steps, saw 99591 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :1
// Phase 1: matrix 302 rows 167 cols
[2024-05-28 21:26:41] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:26:41] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 92/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 13/122 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 272/394 variables, 122/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 149/275 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 75/469 variables, 45/320 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 30/350 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/469 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 350 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 92/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 13/122 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 21:26:43] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-28 21:26:43] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 272/394 variables, 122/128 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 149/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 75/469 variables, 45/322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 30/352 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 15/367 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-28 21:26:44] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:26:44] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 2 ms to minimize.
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
[2024-05-28 21:26:45] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 5/372 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/469 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/469 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 372 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6085 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 7/7 constraints]
After SMT, in 7464ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 22348 ms.
Support contains 17 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 165 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 165 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 164 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 164 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 164 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 163 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 163 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 162 transition count 283
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 162 transition count 283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 161 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 161 transition count 282
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 21 place count 161 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 160 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 160 transition count 273
Applied a total of 23 rules in 62 ms. Remains 160 /167 variables (removed 7) and now considering 273/302 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 160/167 places, 273/302 transitions.
RANDOM walk for 40000 steps (9026 resets) in 387 ms. (103 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (200 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (196 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (205 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (185 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (184 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (180 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (189 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (209 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (201 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (192 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (203 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (195 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (412 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (198 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (202 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 210675 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :1 out of 15
Probabilistic random walk after 210675 steps, saw 91501 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :1
// Phase 1: matrix 273 rows 160 cols
[2024-05-28 21:27:14] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:27:14] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 90/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 246/365 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 128/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 68/433 variables, 41/292 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 27/319 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 2 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/433 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 321 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 90/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/119 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 246/365 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 128/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 68/433 variables, 41/292 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 27/319 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 14/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-28 21:27:18] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-28 21:27:18] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/433 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-28 21:27:19] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/433 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 338 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints]
After SMT, in 6830ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 27427 ms.
Support contains 16 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 273/273 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 159 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 159 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 158 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 158 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 158 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 157 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 157 transition count 257
Applied a total of 7 rules in 30 ms. Remains 157 /160 variables (removed 3) and now considering 257/273 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 157/160 places, 257/273 transitions.
RANDOM walk for 40000 steps (8948 resets) in 303 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1875 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1862 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 188 ms. (211 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1829 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1858 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4160 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 215210 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 14
Probabilistic random walk after 215210 steps, saw 92475 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 257 rows 157 cols
[2024-05-28 21:27:53] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:27:53] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 89/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/118 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 242/360 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 128/250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 54/414 variables, 39/289 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 15/304 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 304 constraints, problems are : Problem set: 0 solved, 14 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 89/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 13/118 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 242/360 variables, 118/122 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 128/250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 54/414 variables, 39/289 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 15/304 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 14/318 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-28 21:27:55] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:27:55] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 2 ms to minimize.
[2024-05-28 21:27:55] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:27:56] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/414 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 322 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 5133ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 29618 ms.
Support contains 16 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 157 /157 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 157/157 places, 257/257 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 257/257 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-28 21:28:27] [INFO ] Invariant cache hit.
[2024-05-28 21:28:27] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 21:28:27] [INFO ] Invariant cache hit.
[2024-05-28 21:28:28] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-28 21:28:28] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2024-05-28 21:28:28] [INFO ] Redundant transitions in 13 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-28 21:28:28] [INFO ] Invariant cache hit.
[2024-05-28 21:28:28] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 257/414 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 143/304 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 304 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 257/414 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 143/304 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 256/560 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/563 constraints. Problems are: Problem set: 4 solved, 252 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 6)
(s136 0)
(s137 1)
(s138 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 563 constraints, problems are : Problem set: 4 solved, 252 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 3/3 constraints]
After SMT, in 46250ms problems are : Problem set: 4 solved, 252 unsolved
Search for dead transitions found 4 dead transitions in 46253ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 157/157 places, 253/257 transitions.
Graph (complete) has 505 edges and 157 vertex of which 153 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 153 /157 variables (removed 4) and now considering 252/253 (removed 1) transitions.
// Phase 1: matrix 252 rows 153 cols
[2024-05-28 21:29:14] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:29:15] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 21:29:15] [INFO ] Invariant cache hit.
[2024-05-28 21:29:15] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-28 21:29:15] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 153/157 places, 252/257 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48012 ms. Remains : 153/157 places, 252/257 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:29:15] [INFO ] Flatten gal took : 43 ms
[2024-05-28 21:29:15] [INFO ] Flatten gal took : 44 ms
[2024-05-28 21:29:16] [INFO ] Input system was already deterministic with 670 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 60 stabilizing places and 105 stable transitions
Graph (complete) has 1107 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 670/670 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 190 transition count 271
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 190 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 190 transition count 265
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 126 place count 152 transition count 226
Iterating global reduction 1 with 38 rules applied. Total rules applied 164 place count 152 transition count 226
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 174 place count 152 transition count 216
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 192 place count 134 transition count 189
Iterating global reduction 2 with 18 rules applied. Total rules applied 210 place count 134 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 219 place count 134 transition count 180
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 224 place count 129 transition count 174
Iterating global reduction 3 with 5 rules applied. Total rules applied 229 place count 129 transition count 174
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 234 place count 124 transition count 169
Iterating global reduction 3 with 5 rules applied. Total rules applied 239 place count 124 transition count 169
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 121 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 121 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 120 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 120 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 119 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 119 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 118 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 118 transition count 162
Applied a total of 251 rules in 16 ms. Remains 118 /231 variables (removed 113) and now considering 162/670 (removed 508) transitions.
// Phase 1: matrix 162 rows 118 cols
[2024-05-28 21:29:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:29:16] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 21:29:16] [INFO ] Invariant cache hit.
[2024-05-28 21:29:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-28 21:29:16] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-28 21:29:16] [INFO ] Invariant cache hit.
[2024-05-28 21:29:16] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-28 21:29:19] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/280 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 78/203 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 161 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 203 constraints, problems are : Problem set: 0 solved, 161 unsolved in 9708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 162/280 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 78/203 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 161/364 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/367 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/367 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/367 constraints. Problems are: Problem set: 3 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 367 constraints, problems are : Problem set: 3 solved, 158 unsolved in 20841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 5/5 constraints]
After SMT, in 30777ms problems are : Problem set: 3 solved, 158 unsolved
Search for dead transitions found 3 dead transitions in 30779ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 118/231 places, 159/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 159
Applied a total of 3 rules in 2 ms. Remains 115 /118 variables (removed 3) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 115 cols
[2024-05-28 21:29:47] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:29:47] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-28 21:29:47] [INFO ] Invariant cache hit.
[2024-05-28 21:29:47] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-28 21:29:47] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/231 places, 159/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31785 ms. Remains : 115/231 places, 159/670 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:47] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:29:47] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:29:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3989626502724850024.gal : 6 ms
[2024-05-28 21:29:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13130443258329683747.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3989626502724850024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13130443258329683747.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:30:18] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:30:18] [INFO ] Applying decomposition
[2024-05-28 21:30:18] [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/graph16821542199775779785.txt' '-o' '/tmp/graph16821542199775779785.bin' '-w' '/tmp/graph16821542199775779785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16821542199775779785.bin' '-l' '-1' '-v' '-w' '/tmp/graph16821542199775779785.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:30:18] [INFO ] Decomposing Gal with order
[2024-05-28 21:30:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:30:18] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-28 21:30:18] [INFO ] Flatten gal took : 89 ms
[2024-05-28 21:30:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 22 ms.
[2024-05-28 21:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15795795858510630084.gal : 8 ms
[2024-05-28 21:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5379886557173553147.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/CTLFireability15795795858510630084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5379886557173553147.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 : 231/231 places, 670/670 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 190 transition count 258
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 190 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 190 transition count 254
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 124 place count 152 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 162 place count 152 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 173 place count 152 transition count 205
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 192 place count 133 transition count 176
Iterating global reduction 2 with 19 rules applied. Total rules applied 211 place count 133 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 222 place count 133 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 227 place count 128 transition count 159
Iterating global reduction 3 with 5 rules applied. Total rules applied 232 place count 128 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 237 place count 123 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 242 place count 123 transition count 154
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 120 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 120 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 250 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 253 place count 117 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 256 place count 117 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 115 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 115 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 114 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 114 transition count 142
Applied a total of 262 rules in 20 ms. Remains 114 /231 variables (removed 117) and now considering 142/670 (removed 528) transitions.
// Phase 1: matrix 142 rows 114 cols
[2024-05-28 21:30:48] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 21:30:48] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-28 21:30:48] [INFO ] Invariant cache hit.
[2024-05-28 21:30:48] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-28 21:30:49] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-28 21:30:49] [INFO ] Invariant cache hit.
[2024-05-28 21:30:49] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-28 21:30:51] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:30:51] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 142/256 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 62/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 183 constraints, problems are : Problem set: 0 solved, 141 unsolved in 8048 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 142/256 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 62/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 141/324 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-28 21:31:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 3/327 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/327 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/327 constraints. Problems are: Problem set: 3 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 327 constraints, problems are : Problem set: 3 solved, 138 unsolved in 14275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 5/5 constraints]
After SMT, in 22477ms problems are : Problem set: 3 solved, 138 unsolved
Search for dead transitions found 3 dead transitions in 22482ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/231 places, 139/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 139
Applied a total of 3 rules in 2 ms. Remains 111 /114 variables (removed 3) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 111 cols
[2024-05-28 21:31:11] [INFO ] Computed 4 invariants in 8 ms
[2024-05-28 21:31:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 21:31:11] [INFO ] Invariant cache hit.
[2024-05-28 21:31:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 21:31:12] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/231 places, 139/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23599 ms. Remains : 111/231 places, 139/670 transitions.
[2024-05-28 21:31:12] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:31:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:31:12] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-28 21:31:12] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:31:12] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:31:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12809587915602290576.gal : 3 ms
[2024-05-28 21:31:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3665374929807962798.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/CTLFireability12809587915602290576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3665374929807962798.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:31:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:31:42] [INFO ] Applying decomposition
[2024-05-28 21:31:42] [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/graph15224895673376377308.txt' '-o' '/tmp/graph15224895673376377308.bin' '-w' '/tmp/graph15224895673376377308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15224895673376377308.bin' '-l' '-1' '-v' '-w' '/tmp/graph15224895673376377308.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:31:42] [INFO ] Decomposing Gal with order
[2024-05-28 21:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:31:42] [INFO ] Removed a total of 125 redundant transitions.
[2024-05-28 21:31:42] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:31:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 8 ms.
[2024-05-28 21:31:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15292095237409776710.gal : 5 ms
[2024-05-28 21:31:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6787603823382145311.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/CTLFireability15292095237409776710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6787603823382145311.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 : 231/231 places, 670/670 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 191 transition count 272
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 191 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 191 transition count 266
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 123 place count 154 transition count 228
Iterating global reduction 1 with 37 rules applied. Total rules applied 160 place count 154 transition count 228
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 171 place count 154 transition count 217
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 190 place count 135 transition count 188
Iterating global reduction 2 with 19 rules applied. Total rules applied 209 place count 135 transition count 188
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 220 place count 135 transition count 177
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 225 place count 130 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 230 place count 130 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 235 place count 125 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 240 place count 125 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 122 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 122 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 249 place count 122 transition count 160
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 251 place count 120 transition count 158
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 120 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 254 place count 119 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 119 transition count 157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 256 place count 118 transition count 154
Iterating global reduction 4 with 1 rules applied. Total rules applied 257 place count 118 transition count 154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 117 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 117 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 116 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 116 transition count 152
Applied a total of 261 rules in 27 ms. Remains 116 /231 variables (removed 115) and now considering 152/670 (removed 518) transitions.
// Phase 1: matrix 152 rows 116 cols
[2024-05-28 21:32:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:32:12] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 21:32:12] [INFO ] Invariant cache hit.
[2024-05-28 21:32:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:32:12] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-28 21:32:12] [INFO ] Invariant cache hit.
[2024-05-28 21:32:12] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-28 21:32:14] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
[2024-05-28 21:32:14] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 152/268 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 73/196 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-28 21:32:18] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/268 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 197 constraints, problems are : Problem set: 3 solved, 148 unsolved in 9554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 4/116 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 152/268 variables, 116/124 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 73/197 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 148/345 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/345 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/345 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 345 constraints, problems are : Problem set: 3 solved, 148 unsolved in 11006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/151 constraints, Known Traps: 3/3 constraints]
After SMT, in 20719ms problems are : Problem set: 3 solved, 148 unsolved
Search for dead transitions found 3 dead transitions in 20720ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/231 places, 149/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 149
Applied a total of 3 rules in 2 ms. Remains 113 /116 variables (removed 3) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 113 cols
[2024-05-28 21:32:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:32:33] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 21:32:33] [INFO ] Invariant cache hit.
[2024-05-28 21:32:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:32:33] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/231 places, 149/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21695 ms. Remains : 113/231 places, 149/670 transitions.
[2024-05-28 21:32:33] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:32:33] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:32:34] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-28 21:32:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:32:34] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14948315211859476838.gal : 2 ms
[2024-05-28 21:32:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10637325477479716749.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/CTLFireability14948315211859476838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10637325477479716749.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:33:04] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:33:04] [INFO ] Applying decomposition
[2024-05-28 21:33:04] [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/graph10160068099309949641.txt' '-o' '/tmp/graph10160068099309949641.bin' '-w' '/tmp/graph10160068099309949641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10160068099309949641.bin' '-l' '-1' '-v' '-w' '/tmp/graph10160068099309949641.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:33:04] [INFO ] Decomposing Gal with order
[2024-05-28 21:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:33:04] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-28 21:33:04] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 6 ms.
[2024-05-28 21:33:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4943591551392541493.gal : 3 ms
[2024-05-28 21:33:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1640244228466289136.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/CTLFireability4943591551392541493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1640244228466289136.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 : 231/231 places, 670/670 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 189 transition count 257
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 189 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 189 transition count 252
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 128 place count 150 transition count 212
Iterating global reduction 1 with 39 rules applied. Total rules applied 167 place count 150 transition count 212
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 178 place count 150 transition count 201
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 198 place count 130 transition count 171
Iterating global reduction 2 with 20 rules applied. Total rules applied 218 place count 130 transition count 171
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 229 place count 130 transition count 160
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 235 place count 124 transition count 153
Iterating global reduction 3 with 6 rules applied. Total rules applied 241 place count 124 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 247 place count 118 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 253 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 114 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 266 place count 111 transition count 137
Iterating global reduction 4 with 3 rules applied. Total rules applied 269 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 271 place count 109 transition count 135
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 109 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 275 place count 107 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 278 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 279 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 280 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 105 transition count 129
Applied a total of 281 rules in 20 ms. Remains 105 /231 variables (removed 126) and now considering 129/670 (removed 541) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 21:33:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:33:34] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:33:34] [INFO ] Invariant cache hit.
[2024-05-28 21:33:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:33:34] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-28 21:33:34] [INFO ] Invariant cache hit.
[2024-05-28 21:33:34] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:33:36] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:33:36] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 169 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 128/297 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:33:44] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 298 constraints, problems are : Problem set: 3 solved, 125 unsolved in 11840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 3/3 constraints]
After SMT, in 18648ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 18650ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/231 places, 126/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 126
Applied a total of 3 rules in 1 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 21:33:53] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:33:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:33:53] [INFO ] Invariant cache hit.
[2024-05-28 21:33:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:33:53] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/231 places, 126/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19468 ms. Remains : 102/231 places, 126/670 transitions.
[2024-05-28 21:33:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:33:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:33:53] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-28 21:33:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:33:53] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:33:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13669162379795067045.gal : 2 ms
[2024-05-28 21:33:53] [INFO ] Time to serialize properties into /tmp/CTLFireability234392648782019815.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/CTLFireability13669162379795067045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability234392648782019815.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:34:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:34:23] [INFO ] Applying decomposition
[2024-05-28 21:34:23] [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/graph6179032435047568688.txt' '-o' '/tmp/graph6179032435047568688.bin' '-w' '/tmp/graph6179032435047568688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6179032435047568688.bin' '-l' '-1' '-v' '-w' '/tmp/graph6179032435047568688.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:34:23] [INFO ] Decomposing Gal with order
[2024-05-28 21:34:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:34:23] [INFO ] Removed a total of 145 redundant transitions.
[2024-05-28 21:34:23] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 5 ms.
[2024-05-28 21:34:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17211413869284303854.gal : 3 ms
[2024-05-28 21:34:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2102422200918890031.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/CTLFireability17211413869284303854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2102422200918890031.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 : 231/231 places, 670/670 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 195 transition count 318
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 195 transition count 318
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 83 place count 195 transition count 307
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 116 place count 162 transition count 273
Iterating global reduction 1 with 33 rules applied. Total rules applied 149 place count 162 transition count 273
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 157 place count 162 transition count 265
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 172 place count 147 transition count 243
Iterating global reduction 2 with 15 rules applied. Total rules applied 187 place count 147 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 194 place count 147 transition count 236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 198 place count 143 transition count 231
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 143 transition count 231
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 205 place count 140 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 208 place count 140 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 210 place count 138 transition count 225
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 138 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 136 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 136 transition count 223
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 218 place count 134 transition count 221
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 134 transition count 221
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 133 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 133 transition count 220
Applied a total of 222 rules in 20 ms. Remains 133 /231 variables (removed 98) and now considering 220/670 (removed 450) transitions.
// Phase 1: matrix 220 rows 133 cols
[2024-05-28 21:34:53] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:34:54] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 21:34:54] [INFO ] Invariant cache hit.
[2024-05-28 21:34:54] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-28 21:34:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-28 21:34:54] [INFO ] Invariant cache hit.
[2024-05-28 21:34:54] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:34:57] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 3 ms to minimize.
[2024-05-28 21:34:58] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/353 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 123/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 263 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 1/133 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:35:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 220/353 variables, 133/141 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 123/264 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 219/483 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:35:17] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:35:18] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
[2024-05-28 21:35:18] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 3/486 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 486 constraints, problems are : Problem set: 3 solved, 216 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 6/6 constraints]
After SMT, in 45022ms problems are : Problem set: 3 solved, 216 unsolved
Search for dead transitions found 3 dead transitions in 45025ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/231 places, 217/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 217
Applied a total of 3 rules in 3 ms. Remains 130 /133 variables (removed 3) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 130 cols
[2024-05-28 21:35:39] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:35:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 21:35:39] [INFO ] Invariant cache hit.
[2024-05-28 21:35:39] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 21:35:40] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/231 places, 217/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46359 ms. Remains : 130/231 places, 217/670 transitions.
[2024-05-28 21:35:40] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:35:40] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:35:40] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 21:35:40] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:35:40] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:35:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8721287000442162319.gal : 2 ms
[2024-05-28 21:35:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15968650482338670378.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/CTLFireability8721287000442162319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15968650482338670378.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:36:10] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:36:10] [INFO ] Applying decomposition
[2024-05-28 21:36:10] [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/graph12786770255695427835.txt' '-o' '/tmp/graph12786770255695427835.bin' '-w' '/tmp/graph12786770255695427835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12786770255695427835.bin' '-l' '-1' '-v' '-w' '/tmp/graph12786770255695427835.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:36:10] [INFO ] Decomposing Gal with order
[2024-05-28 21:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:36:10] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-28 21:36:10] [INFO ] Flatten gal took : 17 ms
[2024-05-28 21:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 5 ms.
[2024-05-28 21:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12189678921402657996.gal : 5 ms
[2024-05-28 21:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10934429082821730534.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/CTLFireability12189678921402657996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10934429082821730534.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 : 231/231 places, 670/670 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 191 transition count 273
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 191 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 191 transition count 267
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 123 place count 154 transition count 229
Iterating global reduction 1 with 37 rules applied. Total rules applied 160 place count 154 transition count 229
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 170 place count 154 transition count 219
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 188 place count 136 transition count 192
Iterating global reduction 2 with 18 rules applied. Total rules applied 206 place count 136 transition count 192
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 215 place count 136 transition count 183
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 131 transition count 177
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 131 transition count 177
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 126 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 126 transition count 172
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 238 place count 123 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 241 place count 123 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 122 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 122 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 244 place count 121 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 121 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 246 place count 120 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 120 transition count 165
Applied a total of 247 rules in 47 ms. Remains 120 /231 variables (removed 111) and now considering 165/670 (removed 505) transitions.
// Phase 1: matrix 165 rows 120 cols
[2024-05-28 21:36:40] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:36:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 21:36:40] [INFO ] Invariant cache hit.
[2024-05-28 21:36:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-28 21:36:41] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2024-05-28 21:36:41] [INFO ] Redundant transitions in 1 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-28 21:36:41] [INFO ] Invariant cache hit.
[2024-05-28 21:36:41] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 21:36:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-28 21:36:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/120 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 21:36:44] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-28 21:36:44] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/285 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 80/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 209 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/120 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/285 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 80/209 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 164/373 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:36:54] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:36:55] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 3/376 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/376 constraints. Problems are: Problem set: 3 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/285 variables, 0/376 constraints. Problems are: Problem set: 3 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 376 constraints, problems are : Problem set: 3 solved, 161 unsolved in 21075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 7/7 constraints]
After SMT, in 29457ms problems are : Problem set: 3 solved, 161 unsolved
Search for dead transitions found 3 dead transitions in 29458ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 120/231 places, 162/670 transitions.
Graph (complete) has 399 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 117 /120 variables (removed 3) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 117 cols
[2024-05-28 21:37:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:37:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 21:37:10] [INFO ] Invariant cache hit.
[2024-05-28 21:37:11] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-28 21:37:11] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 117/231 places, 162/670 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 30878 ms. Remains : 117/231 places, 162/670 transitions.
[2024-05-28 21:37:11] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:37:11] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:37:11] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-28 21:37:11] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:37:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:37:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5488005485059594500.gal : 17 ms
[2024-05-28 21:37:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8070530130337235623.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/CTLFireability5488005485059594500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8070530130337235623.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:37:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:37:41] [INFO ] Applying decomposition
[2024-05-28 21:37:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3277831033384819482.txt' '-o' '/tmp/graph3277831033384819482.bin' '-w' '/tmp/graph3277831033384819482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3277831033384819482.bin' '-l' '-1' '-v' '-w' '/tmp/graph3277831033384819482.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:41] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:41] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-28 21:37:41] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:37:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 4 ms.
[2024-05-28 21:37:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7323865973779726608.gal : 3 ms
[2024-05-28 21:37:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16804358447509736278.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/CTLFireability7323865973779726608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16804358447509736278.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 : 231/231 places, 670/670 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 189 transition count 257
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 189 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 189 transition count 252
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 128 place count 150 transition count 212
Iterating global reduction 1 with 39 rules applied. Total rules applied 167 place count 150 transition count 212
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 179 place count 150 transition count 200
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 199 place count 130 transition count 170
Iterating global reduction 2 with 20 rules applied. Total rules applied 219 place count 130 transition count 170
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 230 place count 130 transition count 159
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 236 place count 124 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 242 place count 124 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 248 place count 118 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 254 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 258 place count 114 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 114 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 264 place count 114 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 111 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 111 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 272 place count 109 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 109 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 107 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 279 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 280 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 105 transition count 128
Applied a total of 282 rules in 37 ms. Remains 105 /231 variables (removed 126) and now considering 128/670 (removed 542) transitions.
// Phase 1: matrix 128 rows 105 cols
[2024-05-28 21:38:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:38:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 21:38:11] [INFO ] Invariant cache hit.
[2024-05-28 21:38:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:38:12] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-05-28 21:38:12] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
[2024-05-28 21:38:12] [INFO ] Invariant cache hit.
[2024-05-28 21:38:12] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 21:38:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:38:13] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 128/233 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-28 21:38:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD116 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/233 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 170 constraints, problems are : Problem set: 3 solved, 124 unsolved in 7406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 128/233 variables, 105/113 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 57/170 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 124/294 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/233 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 294 constraints, problems are : Problem set: 3 solved, 124 unsolved in 8451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 124/127 constraints, Known Traps: 3/3 constraints]
After SMT, in 15971ms problems are : Problem set: 3 solved, 124 unsolved
Search for dead transitions found 3 dead transitions in 15973ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/231 places, 125/670 transitions.
Graph (complete) has 334 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 102 /105 variables (removed 3) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-05-28 21:38:28] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:38:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 21:38:28] [INFO ] Invariant cache hit.
[2024-05-28 21:38:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:38:28] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/231 places, 125/670 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 16918 ms. Remains : 102/231 places, 125/670 transitions.
[2024-05-28 21:38:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:38:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:38:28] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-28 21:38:28] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:38:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:38:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11090401562767626829.gal : 1 ms
[2024-05-28 21:38:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3217729869857266640.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11090401562767626829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3217729869857266640.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9028 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (1839 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3217729869857266640.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 41
Finished probabilistic random walk after 16682 steps, run visited all 1 properties in 28 ms. (steps per millisecond=595 )
Probabilistic random walk after 16682 steps, saw 8501 distinct states, run finished after 35 ms. (steps per millisecond=476 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 670/670 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 200 transition count 374
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 200 transition count 374
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 200 transition count 371
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 94 place count 171 transition count 341
Iterating global reduction 1 with 29 rules applied. Total rules applied 123 place count 171 transition count 341
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 130 place count 171 transition count 334
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 144 place count 157 transition count 314
Iterating global reduction 2 with 14 rules applied. Total rules applied 158 place count 157 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 163 place count 157 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 153 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 153 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 149 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 149 transition count 300
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 146 transition count 296
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 146 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 145 transition count 295
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 145 transition count 295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 188 place count 144 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 144 transition count 294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 190 place count 143 transition count 293
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 143 transition count 293
Applied a total of 191 rules in 21 ms. Remains 143 /231 variables (removed 88) and now considering 293/670 (removed 377) transitions.
// Phase 1: matrix 293 rows 143 cols
[2024-05-28 21:38:28] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:38:28] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 21:38:28] [INFO ] Invariant cache hit.
[2024-05-28 21:38:28] [INFO ] State equation strengthened by 188 read => feed constraints.
[2024-05-28 21:38:29] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-05-28 21:38:29] [INFO ] Invariant cache hit.
[2024-05-28 21:38:29] [INFO ] State equation strengthened by 188 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 1/143 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-28 21:38:35] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-28 21:38:35] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:38:36] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 293/436 variables, 143/151 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 188/339 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 292 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 339 constraints, problems are : Problem set: 0 solved, 292 unsolved in 23011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 1/143 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 293/436 variables, 143/151 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 188/339 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 292/631 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-28 21:39:03] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:39:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:39:04] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD271 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 3/634 constraints. Problems are: Problem set: 3 solved, 289 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/634 constraints. Problems are: Problem set: 3 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 634 constraints, problems are : Problem set: 3 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints]
After SMT, in 53455ms problems are : Problem set: 3 solved, 289 unsolved
Search for dead transitions found 3 dead transitions in 53459ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 143/231 places, 290/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 140 transition count 290
Applied a total of 3 rules in 3 ms. Remains 140 /143 variables (removed 3) and now considering 290/290 (removed 0) transitions.
// Phase 1: matrix 290 rows 140 cols
[2024-05-28 21:39:23] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:39:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 21:39:23] [INFO ] Invariant cache hit.
[2024-05-28 21:39:23] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-05-28 21:39:24] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 140/231 places, 290/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55311 ms. Remains : 140/231 places, 290/670 transitions.
[2024-05-28 21:39:24] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:39:24] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:39:24] [INFO ] Input system was already deterministic with 290 transitions.
[2024-05-28 21:39:24] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:39:24] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:39:24] [INFO ] Time to serialize gal into /tmp/CTLFireability18102238719657210077.gal : 2 ms
[2024-05-28 21:39:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13986146363361793133.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/CTLFireability18102238719657210077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13986146363361793133.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:39:54] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:39:54] [INFO ] Applying decomposition
[2024-05-28 21:39:54] [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/graph1133383719040454697.txt' '-o' '/tmp/graph1133383719040454697.bin' '-w' '/tmp/graph1133383719040454697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1133383719040454697.bin' '-l' '-1' '-v' '-w' '/tmp/graph1133383719040454697.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:39:54] [INFO ] Decomposing Gal with order
[2024-05-28 21:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:39:54] [INFO ] Removed a total of 156 redundant transitions.
[2024-05-28 21:39:54] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 7 ms.
[2024-05-28 21:39:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7198557562819487537.gal : 3 ms
[2024-05-28 21:39:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1879747496206288396.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/CTLFireability7198557562819487537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1879747496206288396.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 : 231/231 places, 670/670 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 198 transition count 345
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 198 transition count 345
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 198 transition count 334
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 107 place count 168 transition count 304
Iterating global reduction 1 with 30 rules applied. Total rules applied 137 place count 168 transition count 304
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 145 place count 168 transition count 296
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 156 place count 157 transition count 280
Iterating global reduction 2 with 11 rules applied. Total rules applied 167 place count 157 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 173 place count 157 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 156 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 156 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 176 place count 155 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 155 transition count 272
Applied a total of 177 rules in 21 ms. Remains 155 /231 variables (removed 76) and now considering 272/670 (removed 398) transitions.
// Phase 1: matrix 272 rows 155 cols
[2024-05-28 21:40:24] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:40:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-28 21:40:24] [INFO ] Invariant cache hit.
[2024-05-28 21:40:24] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-05-28 21:40:25] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-28 21:40:25] [INFO ] Invariant cache hit.
[2024-05-28 21:40:25] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 1/155 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 21:40:30] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 3 ms to minimize.
[2024-05-28 21:40:31] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 21:40:32] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 272/427 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 158/321 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 321 constraints, problems are : Problem set: 0 solved, 271 unsolved in 20265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 155/155 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 1/155 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 21:40:48] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 272/427 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 158/322 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 271/593 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-28 21:40:57] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:40:57] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:40:58] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:40:59] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 4/597 constraints. Problems are: Problem set: 3 solved, 268 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/597 constraints. Problems are: Problem set: 3 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 597 constraints, problems are : Problem set: 3 solved, 268 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 155/155 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 8/8 constraints]
After SMT, in 50665ms problems are : Problem set: 3 solved, 268 unsolved
Search for dead transitions found 3 dead transitions in 50668ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/231 places, 269/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 152 transition count 269
Applied a total of 3 rules in 3 ms. Remains 152 /155 variables (removed 3) and now considering 269/269 (removed 0) transitions.
// Phase 1: matrix 269 rows 152 cols
[2024-05-28 21:41:15] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 21:41:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 21:41:16] [INFO ] Invariant cache hit.
[2024-05-28 21:41:16] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-05-28 21:41:16] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/231 places, 269/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52271 ms. Remains : 152/231 places, 269/670 transitions.
[2024-05-28 21:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:41:16] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-28 21:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3375167464455745232.gal : 2 ms
[2024-05-28 21:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7960948744558093933.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/CTLFireability3375167464455745232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7960948744558093933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:41:46] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:41:46] [INFO ] Applying decomposition
[2024-05-28 21:41:46] [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/graph8706902930163171080.txt' '-o' '/tmp/graph8706902930163171080.bin' '-w' '/tmp/graph8706902930163171080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8706902930163171080.bin' '-l' '-1' '-v' '-w' '/tmp/graph8706902930163171080.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:41:46] [INFO ] Decomposing Gal with order
[2024-05-28 21:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:41:46] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-28 21:41:46] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 5 ms.
[2024-05-28 21:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14033740914764859940.gal : 5 ms
[2024-05-28 21:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6661013210926834587.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/CTLFireability14033740914764859940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6661013210926834587.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 : 231/231 places, 670/670 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 189 transition count 257
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 189 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 189 transition count 252
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 127 place count 151 transition count 213
Iterating global reduction 1 with 38 rules applied. Total rules applied 165 place count 151 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 175 place count 151 transition count 203
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 194 place count 132 transition count 175
Iterating global reduction 2 with 19 rules applied. Total rules applied 213 place count 132 transition count 175
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 223 place count 132 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 228 place count 127 transition count 159
Iterating global reduction 3 with 5 rules applied. Total rules applied 233 place count 127 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 122 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 122 transition count 154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 247 place count 118 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 251 place count 118 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 118 transition count 147
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 256 place count 115 transition count 144
Iterating global reduction 4 with 3 rules applied. Total rules applied 259 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 261 place count 113 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 113 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 111 transition count 138
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 111 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 110 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 110 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 270 place count 109 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 109 transition count 136
Applied a total of 271 rules in 19 ms. Remains 109 /231 variables (removed 122) and now considering 136/670 (removed 534) transitions.
// Phase 1: matrix 136 rows 109 cols
[2024-05-28 21:42:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:42:16] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 21:42:16] [INFO ] Invariant cache hit.
[2024-05-28 21:42:17] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 21:42:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-28 21:42:17] [INFO ] Invariant cache hit.
[2024-05-28 21:42:17] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-28 21:42:19] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-28 21:42:19] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/245 variables, 109/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 59/175 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 175 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/245 variables, 109/116 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 59/175 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 135/310 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-28 21:42:26] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/245 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 311 constraints, problems are : Problem set: 3 solved, 132 unsolved in 11409 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints]
After SMT, in 17562ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 17564ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/231 places, 133/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 133
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 106 cols
[2024-05-28 21:42:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:42:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 21:42:34] [INFO ] Invariant cache hit.
[2024-05-28 21:42:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:42:35] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/231 places, 133/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18375 ms. Remains : 106/231 places, 133/670 transitions.
[2024-05-28 21:42:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:42:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:42:35] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-28 21:42:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:42:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:42:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17968312507912958237.gal : 1 ms
[2024-05-28 21:42:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4287143240460075725.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/CTLFireability17968312507912958237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4287143240460075725.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:43:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:43:05] [INFO ] Applying decomposition
[2024-05-28 21:43:05] [INFO ] Flatten gal took : 3 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/graph11441736689530022822.txt' '-o' '/tmp/graph11441736689530022822.bin' '-w' '/tmp/graph11441736689530022822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11441736689530022822.bin' '-l' '-1' '-v' '-w' '/tmp/graph11441736689530022822.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:43:05] [INFO ] Decomposing Gal with order
[2024-05-28 21:43:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:43:05] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-28 21:43:05] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:43:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 2 ms.
[2024-05-28 21:43:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7498829137514417461.gal : 2 ms
[2024-05-28 21:43:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4516465808005144051.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/CTLFireability7498829137514417461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4516465808005144051.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 : 231/231 places, 670/670 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 196 transition count 345
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 196 transition count 345
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 83 place count 196 transition count 332
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 114 place count 165 transition count 300
Iterating global reduction 1 with 31 rules applied. Total rules applied 145 place count 165 transition count 300
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 150 place count 165 transition count 295
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 163 place count 152 transition count 278
Iterating global reduction 2 with 13 rules applied. Total rules applied 176 place count 152 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 180 place count 152 transition count 274
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 184 place count 148 transition count 269
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 148 transition count 269
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 191 place count 145 transition count 266
Iterating global reduction 3 with 3 rules applied. Total rules applied 194 place count 145 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 143 transition count 263
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 143 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 141 transition count 261
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 141 transition count 261
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 139 transition count 259
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 139 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 138 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 138 transition count 258
Applied a total of 208 rules in 15 ms. Remains 138 /231 variables (removed 93) and now considering 258/670 (removed 412) transitions.
// Phase 1: matrix 258 rows 138 cols
[2024-05-28 21:43:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:43:35] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-28 21:43:35] [INFO ] Invariant cache hit.
[2024-05-28 21:43:35] [INFO ] State equation strengthened by 151 read => feed constraints.
[2024-05-28 21:43:36] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-28 21:43:36] [INFO ] Invariant cache hit.
[2024-05-28 21:43:36] [INFO ] State equation strengthened by 151 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-05-28 21:43:40] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-28 21:43:41] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:43:41] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 258/396 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 151/302 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-28 21:43:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 1/303 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 303 constraints, problems are : Problem set: 3 solved, 254 unsolved in 20361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 138/138 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 4/138 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 6/14 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 258/396 variables, 138/152 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 151/303 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 254/557 constraints. Problems are: Problem set: 3 solved, 254 unsolved
[2024-05-28 21:44:05] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:44:06] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/559 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/559 constraints. Problems are: Problem set: 3 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 559 constraints, problems are : Problem set: 3 solved, 254 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 138/138 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 254/257 constraints, Known Traps: 11/11 constraints]
After SMT, in 50759ms problems are : Problem set: 3 solved, 254 unsolved
Search for dead transitions found 3 dead transitions in 50761ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/231 places, 255/670 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 135 transition count 255
Applied a total of 3 rules in 3 ms. Remains 135 /138 variables (removed 3) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 135 cols
[2024-05-28 21:44:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:44:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 21:44:27] [INFO ] Invariant cache hit.
[2024-05-28 21:44:27] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-05-28 21:44:27] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 135/231 places, 255/670 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52181 ms. Remains : 135/231 places, 255/670 transitions.
[2024-05-28 21:44:27] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:44:27] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:44:27] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-28 21:44:27] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:44:27] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:44:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11274935346789512403.gal : 2 ms
[2024-05-28 21:44:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13359602097851426407.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/CTLFireability11274935346789512403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13359602097851426407.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:44:57] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:44:57] [INFO ] Applying decomposition
[2024-05-28 21:44:57] [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/graph6616688145181377677.txt' '-o' '/tmp/graph6616688145181377677.bin' '-w' '/tmp/graph6616688145181377677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6616688145181377677.bin' '-l' '-1' '-v' '-w' '/tmp/graph6616688145181377677.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:44:57] [INFO ] Decomposing Gal with order
[2024-05-28 21:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:44:57] [INFO ] Removed a total of 226 redundant transitions.
[2024-05-28 21:44:57] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 4 ms.
[2024-05-28 21:44:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15562279079321358865.gal : 2 ms
[2024-05-28 21:44:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3935008185546387886.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/CTLFireability15562279079321358865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3935008185546387886.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 : 231/231 places, 670/670 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 188 transition count 243
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 188 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 188 transition count 239
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 130 place count 148 transition count 198
Iterating global reduction 1 with 40 rules applied. Total rules applied 170 place count 148 transition count 198
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 182 place count 148 transition count 186
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 202 place count 128 transition count 156
Iterating global reduction 2 with 20 rules applied. Total rules applied 222 place count 128 transition count 156
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 233 place count 128 transition count 145
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 239 place count 122 transition count 138
Iterating global reduction 3 with 6 rules applied. Total rules applied 245 place count 122 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 251 place count 116 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 257 place count 116 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 261 place count 112 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 265 place count 112 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 112 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 109 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 109 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 107 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 107 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 278 place count 105 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 104 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 283 place count 103 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 103 transition count 115
Applied a total of 284 rules in 26 ms. Remains 103 /231 variables (removed 128) and now considering 115/670 (removed 555) transitions.
// Phase 1: matrix 115 rows 103 cols
[2024-05-28 21:45:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:45:27] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 21:45:27] [INFO ] Invariant cache hit.
[2024-05-28 21:45:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:45:28] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 21:45:28] [INFO ] Redundant transitions in 0 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 21:45:28] [INFO ] Invariant cache hit.
[2024-05-28 21:45:28] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 21:45:29] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:45:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/218 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 45/155 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 155 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/218 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 45/155 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 114/269 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 21:45:36] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 270 constraints, problems are : Problem set: 3 solved, 111 unsolved in 9476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 3/3 constraints]
After SMT, in 15439ms problems are : Problem set: 3 solved, 111 unsolved
Search for dead transitions found 3 dead transitions in 15441ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 103/231 places, 112/670 transitions.
Graph (complete) has 318 edges and 103 vertex of which 100 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 100 /103 variables (removed 3) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 100 cols
[2024-05-28 21:45:43] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 21:45:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 21:45:43] [INFO ] Invariant cache hit.
[2024-05-28 21:45:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 21:45:44] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 100/231 places, 112/670 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 16190 ms. Remains : 100/231 places, 112/670 transitions.
[2024-05-28 21:45:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:45:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 21:45:44] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-28 21:45:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:45:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:45:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13379260337122117002.gal : 2 ms
[2024-05-28 21:45:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15567792787214039551.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13379260337122117002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15567792787214039551.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15567792787214039551.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 174
RANDOM walk for 40000 steps (8973 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :174 after 226
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :226 after 788
BEST_FIRST walk for 40003 steps (1919 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2771 steps, run visited all 1 properties in 8 ms. (steps per millisecond=346 )
Probabilistic random walk after 2771 steps, saw 1326 distinct states, run finished after 8 ms. (steps per millisecond=346 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 670/670 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 190 transition count 258
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 190 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 87 place count 190 transition count 253
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 125 place count 152 transition count 214
Iterating global reduction 1 with 38 rules applied. Total rules applied 163 place count 152 transition count 214
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 174 place count 152 transition count 203
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 194 place count 132 transition count 173
Iterating global reduction 2 with 20 rules applied. Total rules applied 214 place count 132 transition count 173
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 225 place count 132 transition count 162
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 231 place count 126 transition count 155
Iterating global reduction 3 with 6 rules applied. Total rules applied 237 place count 126 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 242 place count 121 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 247 place count 121 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 118 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 118 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 116 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 116 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 259 place count 114 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 114 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 112 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 112 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 266 place count 111 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 267 place count 111 transition count 137
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 268 place count 110 transition count 136
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 110 transition count 136
Applied a total of 269 rules in 33 ms. Remains 110 /231 variables (removed 121) and now considering 136/670 (removed 534) transitions.
// Phase 1: matrix 136 rows 110 cols
[2024-05-28 21:45:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:45:44] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-28 21:45:44] [INFO ] Invariant cache hit.
[2024-05-28 21:45:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 21:45:44] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-28 21:45:44] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-28 21:45:44] [INFO ] Invariant cache hit.
[2024-05-28 21:45:44] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-28 21:45:46] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:45:46] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/246 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 178 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6067 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/246 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 135/313 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-28 21:45:54] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/314 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/314 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/314 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 314 constraints, problems are : Problem set: 3 solved, 132 unsolved in 14018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints]
After SMT, in 20292ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 20294ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 110/231 places, 133/670 transitions.
Graph (complete) has 351 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 107 cols
[2024-05-28 21:46:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:46:05] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 21:46:05] [INFO ] Invariant cache hit.
[2024-05-28 21:46:05] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 21:46:05] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 107/231 places, 133/670 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 21354 ms. Remains : 107/231 places, 133/670 transitions.
[2024-05-28 21:46:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:46:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:46:05] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-28 21:46:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:46:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 21:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9902838243451827429.gal : 1 ms
[2024-05-28 21:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13789995215250426320.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/CTLFireability9902838243451827429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13789995215250426320.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:46:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:46:35] [INFO ] Applying decomposition
[2024-05-28 21:46:35] [INFO ] Flatten gal took : 3 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/graph5927801485373606725.txt' '-o' '/tmp/graph5927801485373606725.bin' '-w' '/tmp/graph5927801485373606725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5927801485373606725.bin' '-l' '-1' '-v' '-w' '/tmp/graph5927801485373606725.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:46:35] [INFO ] Decomposing Gal with order
[2024-05-28 21:46:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:46:35] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-28 21:46:35] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 3 ms.
[2024-05-28 21:46:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4560919523028983081.gal : 2 ms
[2024-05-28 21:46:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3477879953551899807.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/CTLFireability4560919523028983081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3477879953551899807.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-28 21:47:05] [INFO ] Flatten gal took : 17 ms
[2024-05-28 21:47:05] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:47:05] [INFO ] Applying decomposition
[2024-05-28 21:47:05] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2722697746952759358.txt' '-o' '/tmp/graph2722697746952759358.bin' '-w' '/tmp/graph2722697746952759358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2722697746952759358.bin' '-l' '-1' '-v' '-w' '/tmp/graph2722697746952759358.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:47:05] [INFO ] Decomposing Gal with order
[2024-05-28 21:47:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:47:05] [INFO ] Removed a total of 273 redundant transitions.
[2024-05-28 21:47:05] [INFO ] Flatten gal took : 35 ms
[2024-05-28 21:47:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 6 ms.
[2024-05-28 21:47:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16142969305856306763.gal : 5 ms
[2024-05-28 21:47:05] [INFO ] Time to serialize properties into /tmp/CTLFireability903177237036683304.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/CTLFireability16142969305856306763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability903177237036683304.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 11 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:14:13] [INFO ] Flatten gal took : 21 ms
[2024-05-28 22:14:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9631497266300668826.gal : 4 ms
[2024-05-28 22:14:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3198428299820368878.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/CTLFireability9631497266300668826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3198428299820368878.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 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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r378-smll-171683810800114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 ;