About the Execution of ITS-Tools for ShieldIIPs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.048 | 3600000.00 | 9085143.00 | 5896.20 | FF??FFFTFFTFF?F? | 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.r356-tall-171683760400108.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 ShieldIIPs-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 332K 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 ShieldIIPs-PT-020B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716899215169
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 12:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:26:56] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-28 12:26:56] [INFO ] Transformed 1203 places.
[2024-05-28 12:26:56] [INFO ] Transformed 1183 transitions.
[2024-05-28 12:26:56] [INFO ] Found NUPN structural information;
[2024-05-28 12:26:56] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-020B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 133 place count 1070 transition count 1050
Iterating global reduction 0 with 133 rules applied. Total rules applied 266 place count 1070 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 267 place count 1069 transition count 1049
Iterating global reduction 0 with 1 rules applied. Total rules applied 268 place count 1069 transition count 1049
Applied a total of 268 rules in 257 ms. Remains 1069 /1203 variables (removed 134) and now considering 1049/1183 (removed 134) transitions.
// Phase 1: matrix 1049 rows 1069 cols
[2024-05-28 12:26:57] [INFO ] Computed 181 invariants in 31 ms
[2024-05-28 12:26:57] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-28 12:26:57] [INFO ] Invariant cache hit.
[2024-05-28 12:26:59] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
Running 1048 sub problems to find dead transitions.
[2024-05-28 12:26:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1068 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1069/2118 variables, and 181 constraints, problems are : Problem set: 0 solved, 1048 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1069 constraints, PredecessorRefiner: 1048/1048 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1048 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1068 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
At refinement iteration 1 (OVERLAPS) 1/1069 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-05-28 12:27:45] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 15 ms to minimize.
[2024-05-28 12:27:45] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:27:45] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:27:45] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 3 ms to minimize.
[2024-05-28 12:27:46] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:27:46] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:27:46] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 11 ms to minimize.
[2024-05-28 12:27:47] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 3 ms to minimize.
[2024-05-28 12:27:47] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-28 12:27:47] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-28 12:27:48] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-28 12:27:48] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-28 12:27:49] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-28 12:27:49] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:27:49] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:27:49] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-05-28 12:27:50] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 4 ms to minimize.
[2024-05-28 12:27:50] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 4 ms to minimize.
[2024-05-28 12:27:51] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 4 ms to minimize.
[2024-05-28 12:27:51] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1048 unsolved
[2024-05-28 12:27:57] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 5 ms to minimize.
[2024-05-28 12:27:57] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 6 ms to minimize.
[2024-05-28 12:27:58] [INFO ] Deduced a trap composed of 74 places in 312 ms of which 7 ms to minimize.
[2024-05-28 12:27:58] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 5 ms to minimize.
[2024-05-28 12:27:58] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:27:59] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
SMT process timed out in 60363ms, After SMT, problems are : Problem set: 0 solved, 1048 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 1069/1203 places, 1049/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62592 ms. Remains : 1069/1203 places, 1049/1183 transitions.
Support contains 43 out of 1069 places after structural reductions.
[2024-05-28 12:27:59] [INFO ] Flatten gal took : 165 ms
[2024-05-28 12:28:00] [INFO ] Flatten gal took : 133 ms
[2024-05-28 12:28:00] [INFO ] Input system was already deterministic with 1049 transitions.
Support contains 41 out of 1069 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (13 resets) in 1569 ms. (25 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2024-05-28 12:28:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 994/1069 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:28:01] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-05-28 12:28:01] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-28 12:28:01] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 6 ms to minimize.
[2024-05-28 12:28:01] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:28:02] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 3 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:28:03] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1069 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1069 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1049/2118 variables, 1069/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2118 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2118 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2118/2118 variables, and 1269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1069/1069 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 994/1069 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1069 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:28:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:28:05] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:28:05] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1069 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1049/2118 variables, 1069/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2118 variables, 2/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 12:28:05] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-28 12:28:05] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:28:06] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:28:07] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:28:07] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-28 12:28:07] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-28 12:28:07] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:28:07] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2118 variables, 14/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2118 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2118 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2118/2118 variables, and 1298 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4003 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1069/1069 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 46/46 constraints]
After SMT, in 6830ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1097 ms.
Support contains 6 out of 1069 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1069 transition count 950
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 970 transition count 950
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 970 transition count 849
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 869 transition count 849
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 406 place count 863 transition count 843
Iterating global reduction 2 with 6 rules applied. Total rules applied 412 place count 863 transition count 843
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 863 transition count 840
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 860 transition count 840
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1128 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 135 times.
Drop transitions (Partial Free agglomeration) removed 135 transitions
Iterating global reduction 2 with 135 rules applied. Total rules applied 1263 place count 505 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1264 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1265 place count 503 transition count 484
Applied a total of 1265 rules in 213 ms. Remains 503 /1069 variables (removed 566) and now considering 484/1049 (removed 565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 503/1069 places, 484/1049 transitions.
RANDOM walk for 40000 steps (12 resets) in 466 ms. (85 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
// Phase 1: matrix 484 rows 503 cols
[2024-05-28 12:28:09] [INFO ] Computed 180 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/74 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/147 variables, 35/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/148 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 81/229 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/231 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:28:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/231 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/231 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/233 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/233 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/233 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/235 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/235 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/235 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/236 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/236 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/236 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 93/329 variables, 45/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/329 variables, 13/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/329 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/332 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/332 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/332 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 4/336 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/336 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/336 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 85/421 variables, 41/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/421 variables, 13/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/421 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/422 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/422 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/422 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/424 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/424 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/424 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/426 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/426 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/426 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 1/427 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/427 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 76/503 variables, 38/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/503 variables, 12/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/503 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/505 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/505 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/505 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 4/509 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/509 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/509 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 67/576 variables, 32/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/576 variables, 11/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/576 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 1/577 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/577 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/577 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/579 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/579 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/579 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 49/628 variables, 28/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/628 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/628 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/630 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/630 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/630 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 4/634 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/634 variables, 4/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/634 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 26/660 variables, 14/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/660 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:28:10] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:28:10] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:28:10] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/660 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/660 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 84 (OVERLAPS) 25/685 variables, 12/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/685 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/685 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 1/686 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/686 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/686 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 2/688 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/688 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/688 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 21/709 variables, 10/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/709 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/709 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 25/734 variables, 12/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/734 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/734 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 1/735 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/735 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/735 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/737 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/737 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/737 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 21/758 variables, 10/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/758 variables, 4/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/758 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 25/783 variables, 12/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/783 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/783 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 1/784 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/784 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/784 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 2/786 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/786 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/786 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 21/807 variables, 10/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/807 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/807 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 25/832 variables, 12/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/832 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/832 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 1/833 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/833 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/833 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 2/835 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/835 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/835 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 21/856 variables, 10/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/856 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/856 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 25/881 variables, 12/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/881 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/881 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 1/882 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/882 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/882 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/884 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/884 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/884 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 21/905 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/905 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/905 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 25/930 variables, 12/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/930 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/930 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 1/931 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/931 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/931 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 2/933 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/933 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/933 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 21/954 variables, 10/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/954 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/954 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 23/977 variables, 12/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/977 variables, 3/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/977 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 1/978 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/978 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/978 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/980 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/980 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/980 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 7/987 variables, 6/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/987 variables, 3/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/987 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 0/987 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/74 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/147 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/148 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 81/229 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/231 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/231 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/231 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/233 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/233 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/233 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/235 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/235 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/235 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/236 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/236 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/236 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 93/329 variables, 45/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/329 variables, 13/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/329 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 3/332 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/332 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 4/336 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/336 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/336 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 85/421 variables, 41/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/421 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/421 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 1/422 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/422 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/422 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 2/424 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/424 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/424 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/426 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/426 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/426 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 1/427 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/427 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/427 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 76/503 variables, 38/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/503 variables, 12/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/503 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/505 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/505 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/505 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 4/509 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/509 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/509 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 67/576 variables, 32/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/576 variables, 11/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/576 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/576 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 1/577 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/577 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/577 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 2/579 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/579 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/579 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 49/628 variables, 28/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/628 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:28:10] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:28:11] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:28:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/628 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/628 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 2/630 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/630 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/630 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/634 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/634 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/634 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 26/660 variables, 14/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/660 variables, 6/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/660 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:28:11] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:28:11] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:28:11] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 86 (INCLUDED_ONLY) 0/660 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/660 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 25/685 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/685 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/685 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 1/686 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/686 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/686 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/688 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/688 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/688 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 21/709 variables, 10/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/709 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/709 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 25/734 variables, 12/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/734 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/734 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 1/735 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/735 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/735 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/737 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/737 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/737 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 21/758 variables, 10/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/758 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/758 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 25/783 variables, 12/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/783 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/783 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 1/784 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/784 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/784 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/786 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/786 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/786 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 21/807 variables, 10/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/807 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/807 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 25/832 variables, 12/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/832 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/832 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 1/833 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/833 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/833 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/835 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/835 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/835 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 21/856 variables, 10/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/856 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/856 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 25/881 variables, 12/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/881 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/881 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 1/882 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/882 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/882 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 2/884 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/884 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/884 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 21/905 variables, 10/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/905 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/905 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 25/930 variables, 12/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/930 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/930 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 1/931 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/931 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/931 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 2/933 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/933 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/933 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 21/954 variables, 10/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/954 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/954 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 23/977 variables, 12/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/977 variables, 3/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/977 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 1/978 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/978 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/978 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 2/980 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/980 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/980 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 7/987 variables, 6/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/987 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/987 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 0/987 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 987/987 variables, and 694 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2478ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 484/484 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 483
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 502 transition count 483
Applied a total of 4 rules in 29 ms. Remains 502 /503 variables (removed 1) and now considering 483/484 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 502/503 places, 483/484 transitions.
RANDOM walk for 40000 steps (8 resets) in 327 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 388029 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388029 steps, saw 175649 distinct states, run finished after 3008 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 483 rows 502 cols
[2024-05-28 12:28:15] [INFO ] Computed 180 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/74 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/147 variables, 35/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/148 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 82/230 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/232 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/236 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 92/328 variables, 44/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/328 variables, 14/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/328 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/330 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/330 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/330 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/334 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/334 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/334 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 85/419 variables, 41/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/419 variables, 13/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/419 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/420 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/420 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/420 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/422 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/422 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/422 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/424 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/424 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/424 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/425 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/425 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/425 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 76/501 variables, 38/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/501 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/501 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/503 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/503 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/503 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/507 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/507 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/507 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 67/574 variables, 32/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/574 variables, 11/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/574 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 1/575 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/575 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/575 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/577 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/577 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/577 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 49/626 variables, 28/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 66 (INCLUDED_ONLY) 0/626 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/626 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/628 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/628 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/628 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 4/632 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/632 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/632 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 26/658 variables, 14/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/658 variables, 6/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/658 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 25/683 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/683 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/683 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 1/684 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/684 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/684 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 2/686 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/686 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/686 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 21/707 variables, 10/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/707 variables, 4/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/707 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 25/732 variables, 12/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/732 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/732 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 1/733 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/733 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/733 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 2/735 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/735 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/735 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 21/756 variables, 10/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/756 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/756 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 25/781 variables, 12/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/781 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/781 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 1/782 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/782 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/782 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 2/784 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/784 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/784 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 21/805 variables, 10/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/805 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/805 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 25/830 variables, 12/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/830 variables, 3/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/830 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 1/831 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/831 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/831 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 2/833 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/833 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/833 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 21/854 variables, 10/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/854 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/854 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 25/879 variables, 12/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/879 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/879 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 1/880 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/880 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/880 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 2/882 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/882 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/882 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 21/903 variables, 10/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/903 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/903 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 25/928 variables, 12/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/928 variables, 3/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/928 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 1/929 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/929 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/929 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 2/931 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/931 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/931 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 21/952 variables, 10/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/952 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/952 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 23/975 variables, 12/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/975 variables, 3/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/975 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 1/976 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/976 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/976 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 2/978 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/978 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/978 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 7/985 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/985 variables, 3/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/985 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (OVERLAPS) 0/985 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 682 constraints, problems are : Problem set: 0 solved, 1 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/74 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/147 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/148 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 82/230 variables, 36/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/230 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/232 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/232 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/232 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/236 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/236 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 92/328 variables, 44/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/328 variables, 14/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/328 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/330 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/330 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/334 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/334 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/334 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 85/419 variables, 41/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/419 variables, 13/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/419 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/420 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/420 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/420 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/422 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/422 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/422 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/424 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/424 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/424 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/425 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/425 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/425 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 76/501 variables, 38/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/501 variables, 12/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/501 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 2/503 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/503 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/503 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/507 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/507 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/507 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 67/574 variables, 32/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/574 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/574 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 1/575 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/575 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/575 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/577 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/577 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/577 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 49/626 variables, 28/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/626 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/626 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 2/628 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/628 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/628 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 4/632 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/632 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/632 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 26/658 variables, 14/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/658 variables, 6/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:28:16] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:28:16] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/658 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/658 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 25/683 variables, 12/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/683 variables, 3/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/683 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 1/684 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/684 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/684 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/686 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/686 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/686 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 21/707 variables, 10/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/707 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/707 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 25/732 variables, 12/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/732 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/732 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 1/733 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/733 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/733 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/735 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/735 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/735 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 21/756 variables, 10/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/756 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/756 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 25/781 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/781 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/781 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 1/782 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/782 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/782 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 2/784 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/784 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/784 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 21/805 variables, 10/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/805 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/805 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 25/830 variables, 12/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/830 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/830 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 1/831 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/831 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/831 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 2/833 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/833 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/833 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 21/854 variables, 10/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/854 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/854 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 25/879 variables, 12/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/879 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/879 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 1/880 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/880 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/880 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 2/882 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/882 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/882 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 21/903 variables, 10/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/903 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/903 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 25/928 variables, 12/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/928 variables, 3/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/928 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 1/929 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/929 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/929 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 2/931 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/931 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/931 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 21/952 variables, 10/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/952 variables, 4/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/952 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 23/975 variables, 12/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/975 variables, 3/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/975 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 1/976 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/976 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/976 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 2/978 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/978 variables, 2/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/978 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 7/985 variables, 6/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/985 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/985 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 0/985 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 985/985 variables, and 685 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 19 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 35 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 12:28:17] [INFO ] Invariant cache hit.
[2024-05-28 12:28:17] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-28 12:28:17] [INFO ] Invariant cache hit.
[2024-05-28 12:28:17] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-28 12:28:17] [INFO ] Redundant transitions in 26 ms returned []
Running 481 sub problems to find dead transitions.
[2024-05-28 12:28:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:28:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:28:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:28:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:22] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:28:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:28:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:28:24] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:24] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:28:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:28:26] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:28:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:28:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:28:26] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:28:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:28:28] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 17/216 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 1/502 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:28:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:28:38] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:28:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:28:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/985 variables, and 225 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 45/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (OVERLAPS) 1/502 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (OVERLAPS) 483/985 variables, 502/727 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/985 variables, 481/1208 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 1208 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 45/45 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61017 ms. Remains : 502/502 places, 483/483 transitions.
FORMULA ShieldIIPs-PT-020B-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 243 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 867 transition count 847
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 409 place count 860 transition count 840
Iterating global reduction 2 with 7 rules applied. Total rules applied 416 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 416 place count 860 transition count 836
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 424 place count 856 transition count 836
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1122 place count 507 transition count 487
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1124 place count 505 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1125 place count 504 transition count 485
Applied a total of 1125 rules in 115 ms. Remains 504 /1069 variables (removed 565) and now considering 485/1049 (removed 564) transitions.
// Phase 1: matrix 485 rows 504 cols
[2024-05-28 12:29:18] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 12:29:18] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-28 12:29:18] [INFO ] Invariant cache hit.
[2024-05-28 12:29:19] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-28 12:29:19] [INFO ] Redundant transitions in 81 ms returned [484]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 484 rows 504 cols
[2024-05-28 12:29:19] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:29:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:29:24] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:29:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:29:26] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:29:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 12:29:28] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:29:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:29:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:29:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:29:35] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:29:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:29:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:29:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:29:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 13/248 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:29:40] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:29:40] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:29:40] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:29:41] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 5/253 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1069 places, 484/1049 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30991 ms. Remains : 504/1069 places, 484/1049 transitions.
Stuttering acceptance computed with spot in 415 ms :[false, false, false, false, false, false]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-02
Product exploration explored 100000 steps with 221 reset in 623 ms.
Product exploration explored 100000 steps with 215 reset in 664 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 8 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[false, false, false, false, false, false, false, false]
RANDOM walk for 33840 steps (30 resets) in 210 ms. (160 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 365 ms. Reduced automaton from 8 states, 32 edges and 2 AP (stutter insensitive) to 8 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 427 ms :[false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 345 ms :[false, false, false, false, false, false, false, false]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2024-05-28 12:29:53] [INFO ] Invariant cache hit.
[2024-05-28 12:29:53] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 12:29:53] [INFO ] Invariant cache hit.
[2024-05-28 12:29:53] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-28 12:29:53] [INFO ] Redundant transitions in 68 ms returned []
Running 481 sub problems to find dead transitions.
[2024-05-28 12:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-28 12:29:57] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:29:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:29:59] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:30:00] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:30:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:30:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:30:01] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 3 ms to minimize.
[2024-05-28 12:30:01] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-28 12:30:02] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:30:03] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 12:30:04] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:30:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:30:04] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:30:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:30:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:30:05] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-28 12:30:09] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:30:10] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:30:10] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-28 12:30:11] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:30:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:30:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 16/251 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30094ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30835 ms. Remains : 504/504 places, 484/484 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 8 states, 32 edges and 2 AP (stutter insensitive) to 8 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 462 ms :[false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (36 resets) in 245 ms. (162 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
[2024-05-28 12:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/66 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/140 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/141 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/143 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 76/219 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/223 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/223 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 93/316 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 5/321 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/321 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/321 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/327 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/327 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/327 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 77/404 variables, 40/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/404 variables, 12/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/404 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 5/409 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/409 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/409 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 66/475 variables, 32/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/475 variables, 9/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/475 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/479 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/479 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/479 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/481 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/481 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 70/551 variables, 34/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/551 variables, 9/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/551 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 5/556 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/556 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/556 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 66/622 variables, 32/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/622 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/622 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/626 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/626 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/626 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/628 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/628 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 70/698 variables, 34/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/698 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/698 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 5/703 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/703 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/703 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 63/766 variables, 31/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/766 variables, 9/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/766 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 4/770 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/770 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/770 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 2/772 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/772 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 72 (OVERLAPS) 61/833 variables, 30/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/833 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/833 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 5/838 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/838 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/838 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 40/878 variables, 22/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/878 variables, 7/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/878 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 2/880 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/880 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/880 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/882 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/882 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 52/934 variables, 24/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/934 variables, 6/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/934 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 4/938 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/938 variables, 4/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/938 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 31/969 variables, 18/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/969 variables, 5/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/969 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 2/971 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/971 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/971 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 2/973 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/973 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 15/988 variables, 12/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/988 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/988 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 0/988 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 988/988 variables, and 684 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/27 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/66 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 74/140 variables, 36/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/141 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/143 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 76/219 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/223 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/223 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 93/316 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/316 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/321 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/321 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/327 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/327 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/327 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 77/404 variables, 40/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/404 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/404 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 5/409 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/409 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/409 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 66/475 variables, 32/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/475 variables, 9/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/475 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/479 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/479 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/479 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/481 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/481 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 70/551 variables, 34/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/551 variables, 9/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/551 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 5/556 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/556 variables, 5/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/556 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 66/622 variables, 32/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/622 variables, 9/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/622 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/626 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/626 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/626 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/628 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/628 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 70/698 variables, 34/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/698 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/698 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 5/703 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/703 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/703 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 63/766 variables, 31/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/766 variables, 9/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/766 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/770 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/770 variables, 4/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/770 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/772 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/772 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 61/833 variables, 30/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/833 variables, 7/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/833 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 5/838 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/838 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/838 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 40/878 variables, 22/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/878 variables, 7/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/878 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/880 variables, 3/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/880 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/880 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/882 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/882 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 52/934 variables, 24/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/934 variables, 6/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:30:25] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 89 (INCLUDED_ONLY) 0/934 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/934 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 4/938 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/938 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/938 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 31/969 variables, 18/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/969 variables, 5/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/969 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/971 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/971 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/971 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/973 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/973 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 15/988 variables, 12/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/988 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:30:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 104 (INCLUDED_ONLY) 0/988 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/988 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 0/988 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 988/988 variables, and 687 constraints, problems are : Problem set: 0 solved, 1 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1552ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 484/484 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 504 transition count 484
Applied a total of 117 rules in 18 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 504/504 places, 484/484 transitions.
RANDOM walk for 11564 steps (3 resets) in 86 ms. (132 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 13 factoid took 326 ms. Reduced automaton from 8 states, 32 edges and 2 AP (stutter insensitive) to 8 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 344 ms :[false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 347 ms :[false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 290 reset in 543 ms.
Product exploration explored 100000 steps with 353 reset in 610 ms.
Built C files in :
/tmp/ltsmin5728960772807858384
[2024-05-28 12:30:28] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2024-05-28 12:30:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:30:28] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2024-05-28 12:30:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:30:28] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2024-05-28 12:30:28] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:30:28] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5728960772807858384
Running compilation step : cd /tmp/ltsmin5728960772807858384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1452 ms.
Running link step : cd /tmp/ltsmin5728960772807858384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5728960772807858384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15972092354374528157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2024-05-28 12:30:44] [INFO ] Invariant cache hit.
[2024-05-28 12:30:44] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-28 12:30:44] [INFO ] Invariant cache hit.
[2024-05-28 12:30:44] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-28 12:30:44] [INFO ] Redundant transitions in 52 ms returned []
Running 481 sub problems to find dead transitions.
[2024-05-28 12:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:30:48] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:30:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:30:51] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:30:52] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:30:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:30:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:30:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:30:53] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:30:54] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:30:54] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-28 12:30:54] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:30:54] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:30:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:30:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:30:55] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 12:30:55] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:30:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:30:56] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:31:00] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:31:00] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:31:01] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:31:01] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:31:02] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:31:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:31:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:31:04] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:31:04] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:31:04] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:31:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 16/251 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:31:05] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30848 ms. Remains : 504/504 places, 484/484 transitions.
Built C files in :
/tmp/ltsmin12900724485856099281
[2024-05-28 12:31:14] [INFO ] Computing symmetric may disable matrix : 484 transitions.
[2024-05-28 12:31:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:31:14] [INFO ] Computing symmetric may enable matrix : 484 transitions.
[2024-05-28 12:31:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:31:14] [INFO ] Computing Do-Not-Accords matrix : 484 transitions.
[2024-05-28 12:31:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:31:14] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12900724485856099281
Running compilation step : cd /tmp/ltsmin12900724485856099281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1275 ms.
Running link step : cd /tmp/ltsmin12900724485856099281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12900724485856099281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17316714997062907709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 12:31:30] [INFO ] Flatten gal took : 26 ms
[2024-05-28 12:31:30] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:31:30] [INFO ] Time to serialize gal into /tmp/LTL18095423565187071157.gal : 7 ms
[2024-05-28 12:31:30] [INFO ] Time to serialize properties into /tmp/LTL10822095658307039880.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18095423565187071157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2089609819715810424.hoa' '-atoms' '/tmp/LTL10822095658307039880.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10822095658307039880.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2089609819715810424.hoa
Detected timeout of ITS tools.
[2024-05-28 12:31:45] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:31:45] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:31:45] [INFO ] Time to serialize gal into /tmp/LTL8461994227961104075.gal : 6 ms
[2024-05-28 12:31:45] [INFO ] Time to serialize properties into /tmp/LTL16289062069251929193.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8461994227961104075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16289062069251929193.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p875==1)&&(p926==1))"))||((X(X(!("((p875==1)&&(p926==1))"))))U((X(X(G(!("((p875==1)&&(p926==1))")))))||((X(X(!("((p875==1)&...210
Formula 0 simplified : G(F!"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" R (XXF"((p875==1)&&(p926==1))" & (XX"((p875==1)&&(p926==1))" | F"((p96==1...173
Detected timeout of ITS tools.
[2024-05-28 12:32:00] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:32:00] [INFO ] Applying decomposition
[2024-05-28 12:32:00] [INFO ] Flatten gal took : 20 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/graph4790343875613964339.txt' '-o' '/tmp/graph4790343875613964339.bin' '-w' '/tmp/graph4790343875613964339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4790343875613964339.bin' '-l' '-1' '-v' '-w' '/tmp/graph4790343875613964339.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:32:00] [INFO ] Decomposing Gal with order
[2024-05-28 12:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:32:00] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-28 12:32:00] [INFO ] Flatten gal took : 76 ms
[2024-05-28 12:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 16 ms.
[2024-05-28 12:32:00] [INFO ] Time to serialize gal into /tmp/LTL7689807986249193556.gal : 10 ms
[2024-05-28 12:32:00] [INFO ] Time to serialize properties into /tmp/LTL375971763103883836.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7689807986249193556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL375971763103883836.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("((i14.i0.u134.p875==1)&&(i15.i0.u141.p926==1))"))||((X(X(!("((i14.i0.u134.p875==1)&&(i15.i0.u141.p926==1))"))))U((X(X(G(!("((...326
Formula 0 simplified : G(F!"((i14.i0.u134.p875==1)&&(i15.i0.u141.p926==1))" & (XX"((i14.i0.u134.p875==1)&&(i15.i0.u141.p926==1))" R (XXF"((i14.i0.u134.p875...289
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-02 finished in 177300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 2 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1043
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1043
Applied a total of 12 rules in 50 ms. Remains 1063 /1069 variables (removed 6) and now considering 1043/1049 (removed 6) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:32:15] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:32:16] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 12:32:16] [INFO ] Invariant cache hit.
[2024-05-28 12:32:17] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:32:17] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1069 places, 1043/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31611 ms. Remains : 1063/1069 places, 1043/1049 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-03
Product exploration explored 100000 steps with 284 reset in 406 ms.
Product exploration explored 100000 steps with 283 reset in 384 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Detected a total of 240/1063 stabilizing places and 240/1043 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 968 steps (0 resets) in 10 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1063 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1062 transition count 942
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 962 transition count 942
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 962 transition count 840
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 860 transition count 840
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1114 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 502 transition count 483
Applied a total of 1117 rules in 91 ms. Remains 502 /1063 variables (removed 561) and now considering 483/1043 (removed 560) transitions.
// Phase 1: matrix 483 rows 502 cols
[2024-05-28 12:32:49] [INFO ] Computed 180 invariants in 4 ms
[2024-05-28 12:32:49] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-28 12:32:49] [INFO ] Invariant cache hit.
[2024-05-28 12:32:49] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-28 12:32:49] [INFO ] Redundant transitions in 57 ms returned [482]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 480 sub problems to find dead transitions.
// Phase 1: matrix 482 rows 502 cols
[2024-05-28 12:32:49] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 6 ms to minimize.
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:32:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:32:55] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:32:56] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:32:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:32:58] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:03] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:33:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:33:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:33:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:33:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:33:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:33:05] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:33:05] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:33:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:33:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:33:07] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 16/247 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:33:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:33:08] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:33:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 1/502 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:19] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:33:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:33:19] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:33:19] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/984 variables, and 264 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 84/255 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:33:21] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:33:21] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:33:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 1/502 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:29] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:33:29] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:33:29] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:33:29] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:33:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:33:31] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:33:31] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:33:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:33:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:33] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (OVERLAPS) 482/984 variables, 502/780 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/984 variables, 480/1260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:33:47] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:33:49] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1262 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 100/100 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1063 places, 482/1043 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60952 ms. Remains : 502/1063 places, 482/1043 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/502 stabilizing places and 2/482 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 357 reset in 467 ms.
Product exploration explored 100000 steps with 368 reset in 564 ms.
Built C files in :
/tmp/ltsmin7289528980971744707
[2024-05-28 12:33:51] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2024-05-28 12:33:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:33:51] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2024-05-28 12:33:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:33:51] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2024-05-28 12:33:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:33:51] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7289528980971744707
Running compilation step : cd /tmp/ltsmin7289528980971744707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1334 ms.
Running link step : cd /tmp/ltsmin7289528980971744707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7289528980971744707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7571412727012076240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 481
Applied a total of 2 rules in 15 ms. Remains 501 /502 variables (removed 1) and now considering 481/482 (removed 1) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 12:34:06] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 12:34:07] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-28 12:34:07] [INFO ] Invariant cache hit.
[2024-05-28 12:34:07] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-28 12:34:07] [INFO ] Redundant transitions in 51 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 12:34:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:34:11] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:34:12] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:34:13] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:34:14] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:14] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:34:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:34:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:34:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:34:16] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:34:16] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:34:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:34:16] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:34:16] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:34:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:34:21] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:34:22] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:34:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:34:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:34:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:34:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:34:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:34:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:34:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:34:25] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:34:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:34:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:34:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:34:27] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:31] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/982 variables, and 256 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 171/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 85/256 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:34:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:34:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:34:38] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:34:39] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 1/501 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:34:47] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 13/283 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:34:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:34:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (OVERLAPS) 481/982 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 479/1266 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1266 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 106/106 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/502 places, 481/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60846 ms. Remains : 501/502 places, 481/482 transitions.
Built C files in :
/tmp/ltsmin12111687490793580184
[2024-05-28 12:35:07] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-28 12:35:07] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:35:07] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-28 12:35:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:35:07] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-28 12:35:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:35:07] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12111687490793580184
Running compilation step : cd /tmp/ltsmin12111687490793580184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1331 ms.
Running link step : cd /tmp/ltsmin12111687490793580184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12111687490793580184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14405368448166982777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 12:35:22] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:35:22] [INFO ] Flatten gal took : 17 ms
[2024-05-28 12:35:22] [INFO ] Time to serialize gal into /tmp/LTL11061542379626039636.gal : 4 ms
[2024-05-28 12:35:22] [INFO ] Time to serialize properties into /tmp/LTL9629852122178812337.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11061542379626039636.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12952452292909359539.hoa' '-atoms' '/tmp/LTL9629852122178812337.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9629852122178812337.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12952452292909359539.hoa
Detected timeout of ITS tools.
[2024-05-28 12:35:38] [INFO ] Flatten gal took : 18 ms
[2024-05-28 12:35:38] [INFO ] Flatten gal took : 17 ms
[2024-05-28 12:35:38] [INFO ] Time to serialize gal into /tmp/LTL4842042957661750336.gal : 6 ms
[2024-05-28 12:35:38] [INFO ] Time to serialize properties into /tmp/LTL7096630575601394309.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4842042957661750336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7096630575601394309.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(p320==0)")))||(G("(p721==1)"))))))
Formula 0 simplified : XX(FG!"(p320==0)" & F!"(p721==1)")
Detected timeout of ITS tools.
[2024-05-28 12:35:53] [INFO ] Flatten gal took : 17 ms
[2024-05-28 12:35:53] [INFO ] Applying decomposition
[2024-05-28 12:35:53] [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/graph5317714220606118141.txt' '-o' '/tmp/graph5317714220606118141.bin' '-w' '/tmp/graph5317714220606118141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5317714220606118141.bin' '-l' '-1' '-v' '-w' '/tmp/graph5317714220606118141.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:35:53] [INFO ] Decomposing Gal with order
[2024-05-28 12:35:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:35:53] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-28 12:35:53] [INFO ] Flatten gal took : 52 ms
[2024-05-28 12:35:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 8 ms.
[2024-05-28 12:35:53] [INFO ] Time to serialize gal into /tmp/LTL18415493840296890381.gal : 6 ms
[2024-05-28 12:35:53] [INFO ] Time to serialize properties into /tmp/LTL10126294576089201880.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18415493840296890381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10126294576089201880.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(i5.u46.p320==0)")))||(G("(i11.i2.u110.p721==1)"))))))
Formula 0 simplified : XX(FG!"(i5.u46.p320==0)" & F!"(i11.i2.u110.p721==1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-03 finished in 232512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U X(p2))))'
Support contains 3 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1043
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1043
Applied a total of 12 rules in 43 ms. Remains 1063 /1069 variables (removed 6) and now considering 1043/1049 (removed 6) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:36:08] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:36:08] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-28 12:36:08] [INFO ] Invariant cache hit.
[2024-05-28 12:36:09] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:36:39] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/2106 variables, and 182 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1063 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1063 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:36:55] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:36:55] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:36:56] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:36:56] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:36:56] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:36:57] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-05-28 12:36:57] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
[2024-05-28 12:36:58] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-28 12:36:58] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-05-28 12:36:58] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-28 12:36:59] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-28 12:36:59] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-05-28 12:37:00] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 4 ms to minimize.
[2024-05-28 12:37:00] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 4 ms to minimize.
[2024-05-28 12:37:01] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 4 ms to minimize.
[2024-05-28 12:37:02] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 5 ms to minimize.
[2024-05-28 12:37:02] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 5 ms to minimize.
[2024-05-28 12:37:03] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 5 ms to minimize.
[2024-05-28 12:37:03] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 5 ms to minimize.
[2024-05-28 12:37:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1063 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:37:04] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:37:07] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-28 12:37:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:37:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:37:09] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/2106 variables, and 207 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1063 constraints, PredecessorRefiner: 0/1042 constraints, Known Traps: 26/26 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1069 places, 1043/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61644 ms. Remains : 1063/1069 places, 1043/1049 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 791 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-04 finished in 62025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U G((p1&&F((G(F(p2))||(!p1&&F(p2))))))))))'
Support contains 3 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1043
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1043
Applied a total of 12 rules in 44 ms. Remains 1063 /1069 variables (removed 6) and now considering 1043/1049 (removed 6) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:37:10] [INFO ] Computed 181 invariants in 8 ms
[2024-05-28 12:37:10] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-28 12:37:10] [INFO ] Invariant cache hit.
[2024-05-28 12:37:11] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:37:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:37:41] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:37:41] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/2106 variables, and 183 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1063 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1063 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:37:58] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:37:58] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:37:58] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:37:58] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:37:59] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:37:59] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:38:00] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 3 ms to minimize.
[2024-05-28 12:38:00] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-28 12:38:00] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-28 12:38:01] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-28 12:38:01] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-28 12:38:02] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 4 ms to minimize.
[2024-05-28 12:38:02] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 4 ms to minimize.
[2024-05-28 12:38:03] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 4 ms to minimize.
[2024-05-28 12:38:03] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 4 ms to minimize.
[2024-05-28 12:38:04] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 5 ms to minimize.
[2024-05-28 12:38:05] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 4 ms to minimize.
[2024-05-28 12:38:05] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-28 12:38:05] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 5 ms to minimize.
[2024-05-28 12:38:05] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1063 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:38:11] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:38:11] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:38:11] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1069 places, 1043/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61355 ms. Remains : 1063/1069 places, 1043/1049 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-05
Product exploration explored 100000 steps with 143 reset in 419 ms.
Product exploration explored 100000 steps with 137 reset in 477 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 33548 steps (10 resets) in 254 ms. (131 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-28 12:38:13] [INFO ] Invariant cache hit.
[2024-05-28 12:38:14] [INFO ] [Real]Absence check using 181 positive place invariants in 99 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-05 finished in 64119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(X(G(p1)))))))'
Support contains 2 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1043
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1043
Applied a total of 12 rules in 36 ms. Remains 1063 /1069 variables (removed 6) and now considering 1043/1049 (removed 6) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:38:14] [INFO ] Computed 181 invariants in 8 ms
[2024-05-28 12:38:14] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-28 12:38:14] [INFO ] Invariant cache hit.
[2024-05-28 12:38:15] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:38:45] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
SMT process timed out in 30182ms, After SMT, problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 30194ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1069 places, 1043/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31389 ms. Remains : 1063/1069 places, 1043/1049 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-06 finished in 31658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||X(p2))&&p0))))'
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1042
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1042
Applied a total of 14 rules in 46 ms. Remains 1062 /1069 variables (removed 7) and now considering 1042/1049 (removed 7) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 12:38:46] [INFO ] Computed 181 invariants in 4 ms
[2024-05-28 12:38:46] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-28 12:38:46] [INFO ] Invariant cache hit.
[2024-05-28 12:38:47] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 12:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 181 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:39:33] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:39:33] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:39:33] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:39:33] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:39:34] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:39:34] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:39:34] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 4 ms to minimize.
[2024-05-28 12:39:35] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2024-05-28 12:39:35] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-28 12:39:36] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-28 12:39:36] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 4 ms to minimize.
[2024-05-28 12:39:37] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2024-05-28 12:39:37] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 3 ms to minimize.
[2024-05-28 12:39:38] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-28 12:39:38] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 4 ms to minimize.
[2024-05-28 12:39:39] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 4 ms to minimize.
[2024-05-28 12:39:39] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 4 ms to minimize.
[2024-05-28 12:39:40] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 5 ms to minimize.
[2024-05-28 12:39:41] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-28 12:39:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:39:43] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:39:44] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:39:44] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:39:47] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 8 ms to minimize.
[2024-05-28 12:39:47] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 5 ms to minimize.
[2024-05-28 12:39:47] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 5 ms to minimize.
SMT process timed out in 60415ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1069 places, 1042/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61605 ms. Remains : 1062/1069 places, 1042/1049 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-08
Stuttering criterion allowed to conclude after 2644 steps with 0 reset in 21 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-08 finished in 61749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||(p2 U (p3||G(p2)))||p0)))'
Support contains 7 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1042
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1042
Applied a total of 14 rules in 43 ms. Remains 1062 /1069 variables (removed 7) and now considering 1042/1049 (removed 7) transitions.
[2024-05-28 12:39:47] [INFO ] Invariant cache hit.
[2024-05-28 12:39:48] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-28 12:39:48] [INFO ] Invariant cache hit.
[2024-05-28 12:39:49] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 12:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:40:19] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 182 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:40:34] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:40:35] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:40:35] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:40:35] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:40:36] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:40:36] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 3 ms to minimize.
[2024-05-28 12:40:36] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-28 12:40:37] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-05-28 12:40:37] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-28 12:40:38] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-05-28 12:40:38] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-28 12:40:38] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 4 ms to minimize.
[2024-05-28 12:40:39] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 4 ms to minimize.
[2024-05-28 12:40:40] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 4 ms to minimize.
[2024-05-28 12:40:40] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 4 ms to minimize.
[2024-05-28 12:40:41] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 4 ms to minimize.
[2024-05-28 12:40:41] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 4 ms to minimize.
[2024-05-28 12:40:42] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 5 ms to minimize.
[2024-05-28 12:40:42] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 5 ms to minimize.
[2024-05-28 12:40:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:40:45] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-28 12:40:46] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:40:46] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:40:48] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2024-05-28 12:40:49] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:40:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1062/2104 variables, and 208 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 27/27 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1069 places, 1042/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61415 ms. Remains : 1062/1069 places, 1042/1049 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 31 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-10 finished in 62221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(G(p2))&&p1))))'
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1043
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1043
Applied a total of 12 rules in 41 ms. Remains 1063 /1069 variables (removed 6) and now considering 1043/1049 (removed 6) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:40:50] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 12:40:50] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-28 12:40:50] [INFO ] Invariant cache hit.
[2024-05-28 12:40:51] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:40:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/2106 variables, and 181 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1063 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:41:36] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:41:37] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:41:37] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:41:37] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:41:38] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:41:38] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:41:38] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:41:39] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-28 12:41:39] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 3 ms to minimize.
[2024-05-28 12:41:40] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-05-28 12:41:40] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-28 12:41:40] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-28 12:41:41] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 4 ms to minimize.
[2024-05-28 12:41:41] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 4 ms to minimize.
[2024-05-28 12:41:42] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 5 ms to minimize.
[2024-05-28 12:41:43] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 4 ms to minimize.
[2024-05-28 12:41:43] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 5 ms to minimize.
[2024-05-28 12:41:44] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 4 ms to minimize.
[2024-05-28 12:41:44] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 5 ms to minimize.
[2024-05-28 12:41:45] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1063 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:41:47] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-05-28 12:41:50] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:41:50] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:41:51] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-28 12:41:51] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/2106 variables, and 206 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1063 constraints, PredecessorRefiner: 0/1042 constraints, Known Traps: 25/25 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1069 places, 1043/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61395 ms. Remains : 1063/1069 places, 1043/1049 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-12 finished in 61625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1042
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1042
Applied a total of 14 rules in 44 ms. Remains 1062 /1069 variables (removed 7) and now considering 1042/1049 (removed 7) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 12:41:51] [INFO ] Computed 181 invariants in 11 ms
[2024-05-28 12:41:52] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-28 12:41:52] [INFO ] Invariant cache hit.
[2024-05-28 12:41:52] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 12:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 181 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:42:38] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:42:39] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:42:39] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-28 12:42:39] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:42:40] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:42:40] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:42:40] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-28 12:42:41] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 3 ms to minimize.
[2024-05-28 12:42:41] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-28 12:42:41] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 4 ms to minimize.
[2024-05-28 12:42:42] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-05-28 12:42:42] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-28 12:42:43] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 4 ms to minimize.
[2024-05-28 12:42:43] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 4 ms to minimize.
[2024-05-28 12:42:44] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 4 ms to minimize.
[2024-05-28 12:42:44] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 6 ms to minimize.
[2024-05-28 12:42:45] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 4 ms to minimize.
[2024-05-28 12:42:46] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 5 ms to minimize.
[2024-05-28 12:42:46] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-05-28 12:42:47] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:42:49] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:42:50] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:42:50] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:42:53] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 5 ms to minimize.
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1069 places, 1042/1049 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61392 ms. Remains : 1062/1069 places, 1042/1049 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13
Product exploration explored 100000 steps with 233 reset in 365 ms.
Product exploration explored 100000 steps with 237 reset in 407 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 32107 steps (12 resets) in 220 ms. (145 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 12:42:54] [INFO ] Invariant cache hit.
[2024-05-28 12:42:55] [INFO ] [Real]Absence check using 181 positive place invariants in 104 ms returned sat
[2024-05-28 12:42:57] [INFO ] [Real]Absence check using state equation in 2523 ms returned sat
[2024-05-28 12:42:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:42:58] [INFO ] [Nat]Absence check using 181 positive place invariants in 108 ms returned sat
[2024-05-28 12:43:00] [INFO ] [Nat]Absence check using state equation in 2526 ms returned sat
[2024-05-28 12:43:01] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 60 ms.
[2024-05-28 12:43:12] [INFO ] Added : 585 causal constraints over 117 iterations in 11929 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 18 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-28 12:43:12] [INFO ] Invariant cache hit.
[2024-05-28 12:43:13] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-28 12:43:13] [INFO ] Invariant cache hit.
[2024-05-28 12:43:14] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 12:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
timeout
(s212 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 181 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:43:59] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:43:59] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:44:00] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:44:00] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:44:00] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-28 12:44:01] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:44:01] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-28 12:44:01] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 3 ms to minimize.
[2024-05-28 12:44:02] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-28 12:44:02] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-28 12:44:03] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-28 12:44:03] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-28 12:44:04] [INFO ] Deduced a trap composed of 95 places in 176 ms of which 3 ms to minimize.
[2024-05-28 12:44:04] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 4 ms to minimize.
[2024-05-28 12:44:05] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 4 ms to minimize.
[2024-05-28 12:44:05] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 4 ms to minimize.
[2024-05-28 12:44:06] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 4 ms to minimize.
[2024-05-28 12:44:06] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 4 ms to minimize.
[2024-05-28 12:44:07] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 5 ms to minimize.
[2024-05-28 12:44:07] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:44:09] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:44:11] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:44:11] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:44:13] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 4 ms to minimize.
[2024-05-28 12:44:14] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 5 ms to minimize.
[2024-05-28 12:44:14] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1062/2104 variables, and 207 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 26/26 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in LTL mode , in 1 iterations and 61358 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (12 resets) in 332 ms. (120 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2024-05-28 12:44:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1015/1062 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:44:14] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1062 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1062 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1042/2104 variables, 1062/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:44:15] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-28 12:44:16] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 3 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:44:17] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2104 variables, 20/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:44:18] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 3 ms to minimize.
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2104 variables, 8/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2104 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2104 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2104/2104 variables, and 1278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1062/1062 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1015/1062 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1062 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:44:19] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-28 12:44:20] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1062 variables, 15/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1042/2104 variables, 1062/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2104 variables, 1/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-05-28 12:44:21] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-28 12:44:22] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-28 12:44:22] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:44:22] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:44:22] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2104 variables, 6/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2104 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2104 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2104/2104 variables, and 1300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1062/1062 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 56/56 constraints]
After SMT, in 7842ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1062 transition count 942
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 861 transition count 841
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 1120 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 135 times.
Drop transitions (Partial Free agglomeration) removed 135 transitions
Iterating global reduction 2 with 135 rules applied. Total rules applied 1255 place count 502 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1256 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1257 place count 500 transition count 481
Applied a total of 1257 rules in 89 ms. Remains 500 /1062 variables (removed 562) and now considering 481/1042 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 500/1062 places, 481/1042 transitions.
RANDOM walk for 20449 steps (7 resets) in 130 ms. (156 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 12:44:23] [INFO ] Invariant cache hit.
[2024-05-28 12:44:23] [INFO ] [Real]Absence check using 181 positive place invariants in 107 ms returned sat
[2024-05-28 12:44:26] [INFO ] [Real]Absence check using state equation in 2560 ms returned sat
[2024-05-28 12:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:44:26] [INFO ] [Nat]Absence check using 181 positive place invariants in 112 ms returned sat
[2024-05-28 12:44:29] [INFO ] [Nat]Absence check using state equation in 2779 ms returned sat
[2024-05-28 12:44:29] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:44:29] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:44:30] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:44:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2024-05-28 12:44:30] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-28 12:44:41] [INFO ] Added : 640 causal constraints over 128 iterations in 11365 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 240 reset in 374 ms.
Product exploration explored 100000 steps with 237 reset in 425 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 1 with 420 rules applied. Total rules applied 560 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 701 place count 921 transition count 903
Deduced a syphon composed of 419 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 842 place count 921 transition count 903
Deduced a syphon composed of 419 places in 1 ms
Applied a total of 842 rules in 267 ms. Remains 921 /1062 variables (removed 141) and now considering 903/1042 (removed 139) transitions.
[2024-05-28 12:44:43] [INFO ] Redundant transitions in 56 ms returned [902]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 901 sub problems to find dead transitions.
// Phase 1: matrix 902 rows 921 cols
[2024-05-28 12:44:43] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 12:44:43] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/920 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (OVERLAPS) 1/921 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 901 unsolved
[2024-05-28 12:45:05] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 12:45:05] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 12:45:06] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-28 12:45:07] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD869 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/921 variables, 20/201 constraints. Problems are: Problem set: 93 solved, 808 unsolved
[2024-05-28 12:45:08] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 12:45:08] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 12:45:08] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-28 12:45:09] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-28 12:45:10] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD733 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/921 variables, 20/221 constraints. Problems are: Problem set: 168 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/1823 variables, and 221 constraints, problems are : Problem set: 168 solved, 733 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/921 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 168 solved, 733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 0/0 constraints. Problems are: Problem set: 168 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 169/921 variables, 181/181 constraints. Problems are: Problem set: 168 solved, 733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/921 variables, 40/221 constraints. Problems are: Problem set: 168 solved, 733 unsolved
[2024-05-28 12:45:22] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-28 12:45:22] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-28 12:45:22] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-28 12:45:22] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-05-28 12:45:23] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD166 is UNSAT
[2024-05-28 12:45:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD169 is UNSAT
[2024-05-28 12:45:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
[2024-05-28 12:45:24] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD175 is UNSAT
[2024-05-28 12:45:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/921 variables, 20/241 constraints. Problems are: Problem set: 240 solved, 661 unsolved
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD185 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-05-28 12:45:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD203 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-28 12:45:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/921 variables, 20/261 constraints. Problems are: Problem set: 279 solved, 622 unsolved
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-28 12:45:29] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
Problem TDEAD237 is UNSAT
[2024-05-28 12:45:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/921 variables, 20/281 constraints. Problems are: Problem set: 319 solved, 582 unsolved
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
[2024-05-28 12:45:33] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD260 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
Problem TDEAD261 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
Problem TDEAD263 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-28 12:45:34] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 20/301 constraints. Problems are: Problem set: 359 solved, 542 unsolved
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
Problem TDEAD272 is UNSAT
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-05-28 12:45:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
Problem TDEAD279 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
Problem TDEAD284 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
Problem TDEAD285 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
Problem TDEAD286 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
Problem TDEAD291 is UNSAT
[2024-05-28 12:45:37] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-28 12:45:38] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-28 12:45:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
[2024-05-28 12:45:38] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-28 12:45:38] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 20/321 constraints. Problems are: Problem set: 397 solved, 504 unsolved
[2024-05-28 12:45:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD358 is UNSAT
[2024-05-28 12:45:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD363 is UNSAT
[2024-05-28 12:45:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD390 is UNSAT
[2024-05-28 12:45:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD417 is UNSAT
[2024-05-28 12:45:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD444 is UNSAT
[2024-05-28 12:45:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD471 is UNSAT
[2024-05-28 12:45:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD498 is UNSAT
[2024-05-28 12:45:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD525 is UNSAT
[2024-05-28 12:45:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD552 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 921/1823 variables, and 330 constraints, problems are : Problem set: 407 solved, 494 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/921 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 149/149 constraints]
After SMT, in 60448ms problems are : Problem set: 407 solved, 494 unsolved
Search for dead transitions found 407 dead transitions in 60457ms
Found 407 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 407 transitions
Dead transitions reduction (with SMT) removed 407 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1062 places, 495/1042 transitions.
Graph (complete) has 1788 edges and 921 vertex of which 515 are kept as prefixes of interest. Removing 406 places using SCC suffix rule.8 ms
Discarding 406 places :
Also discarding 0 output transitions
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 1 rules in 22 ms. Remains 515 /921 variables (removed 406) and now considering 495/495 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 515/1062 places, 495/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60817 ms. Remains : 515/1062 places, 495/1042 transitions.
Built C files in :
/tmp/ltsmin13038803141711183939
[2024-05-28 12:45:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13038803141711183939
Running compilation step : cd /tmp/ltsmin13038803141711183939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2206 ms.
Running link step : cd /tmp/ltsmin13038803141711183939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13038803141711183939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9077058691243551369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 22 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 12:45:58] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:45:58] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-28 12:45:58] [INFO ] Invariant cache hit.
[2024-05-28 12:45:59] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 12:45:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:46:29] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:46:29] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:46:29] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 184 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:46:45] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:46:46] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:46:46] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:46:46] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:46:47] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-28 12:46:47] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
[2024-05-28 12:46:48] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-28 12:46:48] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-28 12:46:48] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-28 12:46:49] [INFO ] Deduced a trap composed of 95 places in 181 ms of which 4 ms to minimize.
[2024-05-28 12:46:49] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 4 ms to minimize.
[2024-05-28 12:46:50] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 4 ms to minimize.
[2024-05-28 12:46:51] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 4 ms to minimize.
[2024-05-28 12:46:51] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2024-05-28 12:46:52] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 5 ms to minimize.
[2024-05-28 12:46:53] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 5 ms to minimize.
[2024-05-28 12:46:53] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 5 ms to minimize.
[2024-05-28 12:46:53] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:46:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 12:46:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 12:46:55] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-28 12:46:57] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 4 ms to minimize.
[2024-05-28 12:46:59] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
SMT process timed out in 60248ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Finished structural reductions in LTL mode , in 1 iterations and 61404 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin4094155495948695387
[2024-05-28 12:47:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4094155495948695387
Running compilation step : cd /tmp/ltsmin4094155495948695387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2249 ms.
Running link step : cd /tmp/ltsmin4094155495948695387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4094155495948695387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13579467507535882425.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 12:47:15] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:47:15] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:47:15] [INFO ] Time to serialize gal into /tmp/LTL13248105776783861393.gal : 4 ms
[2024-05-28 12:47:15] [INFO ] Time to serialize properties into /tmp/LTL14272814778515391493.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13248105776783861393.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13040507901206425319.hoa' '-atoms' '/tmp/LTL14272814778515391493.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14272814778515391493.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13040507901206425319.hoa
Detected timeout of ITS tools.
[2024-05-28 12:47:30] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:47:30] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:47:30] [INFO ] Time to serialize gal into /tmp/LTL17195344445030776566.gal : 4 ms
[2024-05-28 12:47:30] [INFO ] Time to serialize properties into /tmp/LTL15658560944609217363.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17195344445030776566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15658560944609217363.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p1097==1)"))||("(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))")))))
Formula 0 simplified : XG(!"(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))" & X!"(p1097==1)")
Detected timeout of ITS tools.
[2024-05-28 12:47:45] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:47:45] [INFO ] Applying decomposition
[2024-05-28 12:47:45] [INFO ] Flatten gal took : 22 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/graph12989552155473353799.txt' '-o' '/tmp/graph12989552155473353799.bin' '-w' '/tmp/graph12989552155473353799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12989552155473353799.bin' '-l' '-1' '-v' '-w' '/tmp/graph12989552155473353799.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:47:45] [INFO ] Decomposing Gal with order
[2024-05-28 12:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:47:45] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:47:45] [INFO ] Flatten gal took : 53 ms
[2024-05-28 12:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 12:47:45] [INFO ] Time to serialize gal into /tmp/LTL1346734436043595476.gal : 19 ms
[2024-05-28 12:47:45] [INFO ] Time to serialize properties into /tmp/LTL8631406244393017278.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1346734436043595476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8631406244393017278.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i18.i2.u367.p1097==1)"))||("(((i15.i6.u310.p928==1)&&(i15.i6.u313.p936==1))&&((i15.i6.u320.p963==1)&&(i18.i2.u367.p1097==1...164
Formula 0 simplified : XG(!"(((i15.i6.u310.p928==1)&&(i15.i6.u313.p936==1))&&((i15.i6.u320.p963==1)&&(i18.i2.u367.p1097==1)))" & X!"(i18.i2.u367.p1097==1)"...156
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 368847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1068 transition count 947
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 967 transition count 846
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 860 transition count 840
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 416 place count 860 transition count 837
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 857 transition count 837
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1130 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 500 transition count 481
Applied a total of 1133 rules in 85 ms. Remains 500 /1069 variables (removed 569) and now considering 481/1049 (removed 568) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 12:48:00] [INFO ] Computed 180 invariants in 1 ms
[2024-05-28 12:48:01] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 12:48:01] [INFO ] Invariant cache hit.
[2024-05-28 12:48:01] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-05-28 12:48:01] [INFO ] Redundant transitions in 45 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 12:48:01] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:48:05] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:48:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-28 12:48:07] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:48:08] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:48:08] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:48:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:48:08] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:48:08] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:48:09] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:48:10] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:48:11] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:48:11] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:48:11] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 12:48:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:48:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:48:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-05-28 12:48:16] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:48:17] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:48:19] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:48:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:48:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:48:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:48:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:48:21] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:48:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 18/258 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:21] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:48:22] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:48:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:48:22] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:48:22] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:48:22] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:48:23] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 7/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30094ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1069 places, 480/1049 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30972 ms. Remains : 500/1069 places, 480/1049 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-15
Product exploration explored 100000 steps with 373 reset in 459 ms.
Product exploration explored 100000 steps with 374 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 1044 steps (0 resets) in 14 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-28 12:48:33] [INFO ] Invariant cache hit.
[2024-05-28 12:48:33] [INFO ] [Real]Absence check using 180 positive place invariants in 50 ms returned sat
[2024-05-28 12:48:33] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2024-05-28 12:48:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:48:34] [INFO ] [Nat]Absence check using 180 positive place invariants in 48 ms returned sat
[2024-05-28 12:48:34] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2024-05-28 12:48:34] [INFO ] Computed and/alt/rep : 479/1188/479 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-28 12:48:39] [INFO ] Added : 398 causal constraints over 80 iterations in 5349 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 12:48:39] [INFO ] Invariant cache hit.
[2024-05-28 12:48:40] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-28 12:48:40] [INFO ] Invariant cache hit.
[2024-05-28 12:48:40] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-28 12:48:40] [INFO ] Redundant transitions in 50 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 12:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:48:44] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:48:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:48:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:48:47] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:48:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:48:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:48:47] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:48:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:48:49] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:48:50] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:48:50] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:48:50] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 12:48:50] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 12:48:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:48:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:48:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
[2024-05-28 12:48:55] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:48:55] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:48:56] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:48:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:48:57] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:48:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:48:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:48:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:48:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:48:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:48:59] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:49:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:49:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:49:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:49:05] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/980 variables, and 264 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 84/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:49:12] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/980 variables, 500/765 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 479/1244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:49:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:49:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:49:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:49:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:49:30] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1249 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 90/90 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60807 ms. Remains : 500/500 places, 480/480 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 1113 steps (0 resets) in 9 ms. (111 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-28 12:49:41] [INFO ] Invariant cache hit.
[2024-05-28 12:49:41] [INFO ] [Real]Absence check using 180 positive place invariants in 45 ms returned sat
[2024-05-28 12:49:41] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-05-28 12:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:49:42] [INFO ] [Nat]Absence check using 180 positive place invariants in 48 ms returned sat
[2024-05-28 12:49:42] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-28 12:49:42] [INFO ] Computed and/alt/rep : 479/1188/479 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-28 12:49:47] [INFO ] Added : 398 causal constraints over 80 iterations in 5289 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 380 reset in 461 ms.
Product exploration explored 100000 steps with 379 reset in 531 ms.
Built C files in :
/tmp/ltsmin475710243050413866
[2024-05-28 12:49:48] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2024-05-28 12:49:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:49:48] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2024-05-28 12:49:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:49:49] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2024-05-28 12:49:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:49:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin475710243050413866
Running compilation step : cd /tmp/ltsmin475710243050413866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1324 ms.
Running link step : cd /tmp/ltsmin475710243050413866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin475710243050413866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13928109674395245130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 12:50:04] [INFO ] Invariant cache hit.
[2024-05-28 12:50:04] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-28 12:50:04] [INFO ] Invariant cache hit.
[2024-05-28 12:50:04] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-28 12:50:04] [INFO ] Redundant transitions in 47 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 12:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:50:08] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:50:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:50:10] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:50:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:50:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:50:11] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:50:11] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:50:11] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:50:12] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:50:13] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:50:14] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:50:14] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:50:14] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 12:50:14] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:50:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:50:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:50:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:50:19] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:50:20] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:50:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:50:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:50:21] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:50:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:50:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:50:22] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:50:22] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:50:22] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:50:22] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:50:23] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:50:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:50:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:29] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 timeout
0.0)
(s296 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/980 variables, and 264 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 84/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:36] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/980 variables, 500/765 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 479/1244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:50:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:50:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:50:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:50:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:50:54] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1249 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 90/90 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60783 ms. Remains : 500/500 places, 480/480 transitions.
Built C files in :
/tmp/ltsmin11446089572812947140
[2024-05-28 12:51:04] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2024-05-28 12:51:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:51:04] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2024-05-28 12:51:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:51:04] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2024-05-28 12:51:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:51:04] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11446089572812947140
Running compilation step : cd /tmp/ltsmin11446089572812947140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1301 ms.
Running link step : cd /tmp/ltsmin11446089572812947140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11446089572812947140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12419117640927775391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 12:51:20] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:51:20] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:51:20] [INFO ] Time to serialize gal into /tmp/LTL2480269528986010889.gal : 3 ms
[2024-05-28 12:51:20] [INFO ] Time to serialize properties into /tmp/LTL16324056368612675060.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2480269528986010889.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3112134139723035649.hoa' '-atoms' '/tmp/LTL16324056368612675060.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16324056368612675060.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3112134139723035649.hoa
Detected timeout of ITS tools.
[2024-05-28 12:51:35] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:51:35] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:51:35] [INFO ] Time to serialize gal into /tmp/LTL4700769131463623481.gal : 7 ms
[2024-05-28 12:51:35] [INFO ] Time to serialize properties into /tmp/LTL15125705680884742682.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4700769131463623481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15125705680884742682.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(p711==1)")))
Formula 0 simplified : G!"(p711==1)"
Detected timeout of ITS tools.
[2024-05-28 12:51:50] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:51:50] [INFO ] Applying decomposition
[2024-05-28 12:51:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17550473296931900680.txt' '-o' '/tmp/graph17550473296931900680.bin' '-w' '/tmp/graph17550473296931900680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17550473296931900680.bin' '-l' '-1' '-v' '-w' '/tmp/graph17550473296931900680.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:51:50] [INFO ] Decomposing Gal with order
[2024-05-28 12:51:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:51:50] [INFO ] Removed a total of 317 redundant transitions.
[2024-05-28 12:51:50] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 6 ms.
[2024-05-28 12:51:50] [INFO ] Time to serialize gal into /tmp/LTL14210863602784203194.gal : 5 ms
[2024-05-28 12:51:50] [INFO ] Time to serialize properties into /tmp/LTL12442611878474948868.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14210863602784203194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12442611878474948868.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("(i11.i1.u107.p711==1)")))
Formula 0 simplified : G!"(i11.i1.u107.p711==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-15 finished in 244754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLFireability-03
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 968 transition count 846
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 860 transition count 840
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 416 place count 860 transition count 837
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 857 transition count 837
Performed 352 Post agglomeration using F-continuation condition.Transition count delta: 352
Deduced a syphon composed of 352 places in 1 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 2 with 704 rules applied. Total rules applied 1126 place count 505 transition count 485
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 503 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 502 transition count 483
Applied a total of 1129 rules in 81 ms. Remains 502 /1069 variables (removed 567) and now considering 483/1049 (removed 566) transitions.
// Phase 1: matrix 483 rows 502 cols
[2024-05-28 12:52:05] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 12:52:06] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-28 12:52:06] [INFO ] Invariant cache hit.
[2024-05-28 12:52:06] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2024-05-28 12:52:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:52:10] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:52:11] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:52:12] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:52:13] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:52:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:52:14] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:52:14] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:52:14] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:52:15] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:52:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:52:16] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:52:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:52:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:52:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:52:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:52:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:52:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:52:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:52:22] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:52:23] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:52:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:52:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:52:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:52:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:52:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 17/248 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 12:52:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:52:26] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:52:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 481 unsolved
SMT process timed out in 30082ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in LI_LTL mode, iteration 1 : 502/1069 places, 483/1049 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 30824 ms. Remains : 502/1069 places, 483/1049 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-03
Product exploration explored 100000 steps with 199 reset in 480 ms.
Product exploration explored 100000 steps with 225 reset in 563 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/502 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 502 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 12:52:38] [INFO ] Invariant cache hit.
[2024-05-28 12:52:38] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-28 12:52:38] [INFO ] Invariant cache hit.
[2024-05-28 12:52:39] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-28 12:52:39] [INFO ] Redundant transitions in 52 ms returned [482]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 480 sub problems to find dead transitions.
// Phase 1: matrix 482 rows 502 cols
[2024-05-28 12:52:39] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:52:42] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-28 12:52:43] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:52:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:52:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:52:46] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:52:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:52:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:52:46] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:52:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:52:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:52:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:52:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:52:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:49] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:52:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:52:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:52:50] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:52:53] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:52:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:52:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:52:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:52:54] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:52:54] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:52:54] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:52:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-28 12:52:56] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:52:56] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:52:57] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:52:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:52:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:52:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 19/250 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-28 12:52:59] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 6/256 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30082ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/502 places, 482/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 502 /502 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30807 ms. Remains : 502/502 places, 482/483 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/502 stabilizing places and 2/482 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 328 reset in 479 ms.
Product exploration explored 100000 steps with 338 reset in 566 ms.
Built C files in :
/tmp/ltsmin1095664971282235436
[2024-05-28 12:53:11] [INFO ] Computing symmetric may disable matrix : 482 transitions.
[2024-05-28 12:53:11] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:53:11] [INFO ] Computing symmetric may enable matrix : 482 transitions.
[2024-05-28 12:53:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:53:11] [INFO ] Computing Do-Not-Accords matrix : 482 transitions.
[2024-05-28 12:53:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:53:11] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1095664971282235436
Running compilation step : cd /tmp/ltsmin1095664971282235436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1309 ms.
Running link step : cd /tmp/ltsmin1095664971282235436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1095664971282235436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17432680148663974821.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 482/482 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 481
Applied a total of 2 rules in 12 ms. Remains 501 /502 variables (removed 1) and now considering 481/482 (removed 1) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 12:53:26] [INFO ] Computed 180 invariants in 1 ms
[2024-05-28 12:53:26] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-28 12:53:26] [INFO ] Invariant cache hit.
[2024-05-28 12:53:26] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-28 12:53:26] [INFO ] Redundant transitions in 53 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 12:53:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:30] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:53:30] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:53:30] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:53:30] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:53:31] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:53:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:53:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:53:35] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:53:36] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:53:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:53:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:53:41] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:53:42] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:53:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:53:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:53:45] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:53:45] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:53:45] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:53:46] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:53:46] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:53:46] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-28 12:53:46] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-28 12:53:46] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:50] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/982 variables, and 269 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 171/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 98/269 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:53:58] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:53:58] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:53:58] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:53:58] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:54:02] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:54:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:54:06] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 1/501 variables, 9/285 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:54:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:54:14] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:54:14] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:54:14] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:54:17] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:54:17] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:54:17] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:54:17] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:54:17] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 9/294 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:54:19] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:54:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:54:23] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/982 variables, and 297 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/479 constraints, Known Traps: 117/117 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/502 places, 481/482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60825 ms. Remains : 501/502 places, 481/482 transitions.
Built C files in :
/tmp/ltsmin9407818654255590427
[2024-05-28 12:54:27] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-28 12:54:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:54:27] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-28 12:54:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:54:27] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-28 12:54:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 12:54:27] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9407818654255590427
Running compilation step : cd /tmp/ltsmin9407818654255590427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1307 ms.
Running link step : cd /tmp/ltsmin9407818654255590427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9407818654255590427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8444650008754523290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 12:54:42] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:54:42] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:54:42] [INFO ] Time to serialize gal into /tmp/LTL16804382231608321348.gal : 3 ms
[2024-05-28 12:54:42] [INFO ] Time to serialize properties into /tmp/LTL6116604250287176972.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16804382231608321348.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13440564534789750363.hoa' '-atoms' '/tmp/LTL6116604250287176972.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6116604250287176972.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13440564534789750363.hoa
Detected timeout of ITS tools.
[2024-05-28 12:54:57] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:54:57] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:54:57] [INFO ] Time to serialize gal into /tmp/LTL13095166438930604575.gal : 3 ms
[2024-05-28 12:54:57] [INFO ] Time to serialize properties into /tmp/LTL8248144204807234761.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13095166438930604575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8248144204807234761.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(p320==0)")))||(G("(p721==1)"))))))
Formula 0 simplified : XX(FG!"(p320==0)" & F!"(p721==1)")
Detected timeout of ITS tools.
[2024-05-28 12:55:12] [INFO ] Flatten gal took : 20 ms
[2024-05-28 12:55:12] [INFO ] Applying decomposition
[2024-05-28 12:55:12] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6820764530304981715.txt' '-o' '/tmp/graph6820764530304981715.bin' '-w' '/tmp/graph6820764530304981715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6820764530304981715.bin' '-l' '-1' '-v' '-w' '/tmp/graph6820764530304981715.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:55:12] [INFO ] Decomposing Gal with order
[2024-05-28 12:55:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:55:12] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-28 12:55:12] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:55:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 10 ms.
[2024-05-28 12:55:12] [INFO ] Time to serialize gal into /tmp/LTL1854099449648358054.gal : 4 ms
[2024-05-28 12:55:12] [INFO ] Time to serialize properties into /tmp/LTL472576360490379505.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1854099449648358054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL472576360490379505.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("(i5.u46.p320==0)")))||(G("(i11.i2.u110.p721==1)"))))))
Formula 0 simplified : XX(FG!"(i5.u46.p320==0)" & F!"(i11.i2.u110.p721==1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-03 finished in 202092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-020B-LTLFireability-13
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1069/1069 places, 1049/1049 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 968 transition count 847
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 867 transition count 847
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 409 place count 860 transition count 840
Iterating global reduction 2 with 7 rules applied. Total rules applied 416 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 416 place count 860 transition count 836
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 424 place count 856 transition count 836
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1130 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 500 transition count 481
Applied a total of 1133 rules in 77 ms. Remains 500 /1069 variables (removed 569) and now considering 481/1049 (removed 568) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 12:55:27] [INFO ] Computed 180 invariants in 4 ms
[2024-05-28 12:55:28] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-28 12:55:28] [INFO ] Invariant cache hit.
[2024-05-28 12:55:28] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-05-28 12:55:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:55:32] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:55:33] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:55:34] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:55:35] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:36] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:55:36] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:55:36] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:55:36] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:55:36] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:55:37] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-28 12:55:38] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-28 12:55:38] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:55:38] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-28 12:55:38] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:55:38] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 12:55:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:55:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:55:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:55:39] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:55:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:55:44] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:55:44] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:55:44] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:55:45] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:55:45] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:55:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:55:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:55:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:55:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:55:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:55:48] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:55:48] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:55:48] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:55:49] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:55:49] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:55:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:55:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:55:53] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:55:54] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-28 12:55:54] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/981 variables, and 269 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:55:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:03] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:56:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/981 variables, 500/772 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 480/1252 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:56:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:56:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:56:21] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:56:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:56:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:56:23] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:56:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:56:24] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:56:26] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:56:26] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:56:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:56:27] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 1265 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 105/105 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LI_LTL mode, iteration 1 : 500/1069 places, 481/1049 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60867 ms. Remains : 500/1069 places, 481/1049 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13
Product exploration explored 100000 steps with 1763 reset in 413 ms.
Product exploration explored 100000 steps with 1790 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 37537 steps (34 resets) in 258 ms. (144 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-28 12:56:30] [INFO ] Invariant cache hit.
[2024-05-28 12:56:30] [INFO ] [Real]Absence check using 180 positive place invariants in 50 ms returned sat
[2024-05-28 12:56:31] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-28 12:56:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:56:31] [INFO ] [Nat]Absence check using 180 positive place invariants in 47 ms returned sat
[2024-05-28 12:56:31] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-28 12:56:31] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-28 12:56:40] [INFO ] Added : 480 causal constraints over 96 iterations in 8260 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-28 12:56:40] [INFO ] Invariant cache hit.
[2024-05-28 12:56:40] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-28 12:56:40] [INFO ] Invariant cache hit.
[2024-05-28 12:56:40] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-05-28 12:56:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:44] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:56:44] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:56:44] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:56:44] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:56:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:56:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:56:47] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:48] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:56:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:56:48] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:56:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:56:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:56:50] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-28 12:56:50] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:56:50] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-28 12:56:50] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:56:50] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 12:56:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:56:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:56:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:56:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:56:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:56:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-28 12:56:56] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:56:56] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2024-05-28 12:56:57] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-05-28 12:56:57] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:56:57] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:56:57] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:56:58] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:56:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:56:59] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:56:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:56:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:56:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:57:00] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:57:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:57:01] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:57:01] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:57:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:57:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:57:05] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:57:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:57:06] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:57:07] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/981 variables, and 269 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:57:11] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:57:15] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:57:15] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/981 variables, 500/772 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 480/1252 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:57:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:57:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:57:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:57:33] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:57:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:57:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:57:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:57:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:57:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:57:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:57:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:57:39] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:57:39] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 1265 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 105/105 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 60792 ms. Remains : 500/500 places, 481/481 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 27930 steps (25 resets) in 155 ms. (179 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 12:57:41] [INFO ] Invariant cache hit.
[2024-05-28 12:57:41] [INFO ] [Real]Absence check using 180 positive place invariants in 50 ms returned sat
[2024-05-28 12:57:42] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-28 12:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 12:57:42] [INFO ] [Nat]Absence check using 180 positive place invariants in 49 ms returned sat
[2024-05-28 12:57:43] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-28 12:57:43] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-28 12:57:51] [INFO ] Added : 480 causal constraints over 96 iterations in 8210 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1778 reset in 405 ms.
Product exploration explored 100000 steps with 1796 reset in 505 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-28 12:57:52] [INFO ] Redundant transitions in 53 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 12:57:52] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:57:56] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-28 12:57:57] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:57:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:57:59] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:58:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:58:01] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:58:02] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:58:02] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:58:02] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:58:02] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-28 12:58:02] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.
[2024-05-28 12:58:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:58:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:07] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:58:08] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:58:08] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:58:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:58:08] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:58:08] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:58:09] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-28 12:58:10] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:58:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:58:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:58:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:58:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:58:11] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:58:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:58:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:58:12] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:58:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:58:13] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:58:13] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:58:16] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:58:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:58:16] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:58:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:18] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:58:18] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/980 variables, and 272 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 92/272 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:58:24] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:58:24] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:58:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:28] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:32] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-28 12:58:32] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/779 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 479/1258 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 12:58:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:58:46] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:58:46] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:58:47] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:58:47] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:58:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:58:52] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1265 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 106/106 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60201 ms. Remains : 500/500 places, 480/481 transitions.
Built C files in :
/tmp/ltsmin16621120779334197371
[2024-05-28 12:58:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621120779334197371
Running compilation step : cd /tmp/ltsmin16621120779334197371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin16621120779334197371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16621120779334197371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12903139586744258272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 12:59:07] [INFO ] Computed 180 invariants in 1 ms
[2024-05-28 12:59:08] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-28 12:59:08] [INFO ] Invariant cache hit.
[2024-05-28 12:59:08] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2024-05-28 12:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:59:12] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:59:13] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:59:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:59:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 12:59:16] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-28 12:59:17] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:59:18] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:59:18] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:59:18] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-05-28 12:59:18] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 12:59:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:59:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:59:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:59:19] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:59:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:59:24] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:59:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:59:24] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:59:24] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-28 12:59:25] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-28 12:59:25] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:59:26] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:59:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:59:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:59:28] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:59:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:59:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:59:29] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:59:29] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:59:32] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:59:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:33] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:59:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:59:34] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-28 12:59:34] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/981 variables, and 269 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:59:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (OVERLAPS) 481/981 variables, 500/772 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/981 variables, 480/1252 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:59:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 13:00:00] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 13:00:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 13:00:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 13:00:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 13:00:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:00:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 13:00:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 13:00:04] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 13:00:06] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 13:00:06] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 13:00:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 13:00:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 981/981 variables, and 1265 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 105/105 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in LTL mode , in 1 iterations and 60772 ms. Remains : 500/500 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin17350852997057874409
[2024-05-28 13:00:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17350852997057874409
Running compilation step : cd /tmp/ltsmin17350852997057874409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 973 ms.
Running link step : cd /tmp/ltsmin17350852997057874409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17350852997057874409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11878185777017333700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 13:00:23] [INFO ] Flatten gal took : 13 ms
[2024-05-28 13:00:23] [INFO ] Flatten gal took : 14 ms
[2024-05-28 13:00:23] [INFO ] Time to serialize gal into /tmp/LTL940017131772386308.gal : 2 ms
[2024-05-28 13:00:23] [INFO ] Time to serialize properties into /tmp/LTL13137744778832997152.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL940017131772386308.gal' '-t' 'CGAL' '-hoa' '/tmp/aut615751340243498941.hoa' '-atoms' '/tmp/LTL13137744778832997152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL13137744778832997152.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut615751340243498941.hoa
Detected timeout of ITS tools.
[2024-05-28 13:00:38] [INFO ] Flatten gal took : 13 ms
[2024-05-28 13:00:38] [INFO ] Flatten gal took : 13 ms
[2024-05-28 13:00:38] [INFO ] Time to serialize gal into /tmp/LTL2472555179205639684.gal : 2 ms
[2024-05-28 13:00:38] [INFO ] Time to serialize properties into /tmp/LTL2707050958366759594.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2472555179205639684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2707050958366759594.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(p1097==1)"))||("(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))")))))
Formula 0 simplified : XG(!"(((p928==1)&&(p936==1))&&((p963==1)&&(p1097==1)))" & X!"(p1097==1)")
Detected timeout of ITS tools.
[2024-05-28 13:00:53] [INFO ] Flatten gal took : 16 ms
[2024-05-28 13:00:53] [INFO ] Applying decomposition
[2024-05-28 13:00:53] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4966249492480563029.txt' '-o' '/tmp/graph4966249492480563029.bin' '-w' '/tmp/graph4966249492480563029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4966249492480563029.bin' '-l' '-1' '-v' '-w' '/tmp/graph4966249492480563029.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:00:53] [INFO ] Decomposing Gal with order
[2024-05-28 13:00:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:00:54] [INFO ] Removed a total of 317 redundant transitions.
[2024-05-28 13:00:54] [INFO ] Flatten gal took : 31 ms
[2024-05-28 13:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 4 ms.
[2024-05-28 13:00:54] [INFO ] Time to serialize gal into /tmp/LTL17898095866546542336.gal : 5 ms
[2024-05-28 13:00:54] [INFO ] Time to serialize properties into /tmp/LTL11496214134799858884.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17898095866546542336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11496214134799858884.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(i18.i2.u164.p1097==1)"))||("(((i15.i2.u139.p928==1)&&(i15.i2.u141.p936==1))&&((i15.i1.u144.p963==1)&&(i18.i2.u164.p1097==1...164
Formula 0 simplified : XG(!"(((i15.i2.u139.p928==1)&&(i15.i2.u141.p936==1))&&((i15.i1.u144.p963==1)&&(i18.i2.u164.p1097==1)))" & X!"(i18.i2.u164.p1097==1)"...156
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 341525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-28 13:01:09] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12955603288308538755
[2024-05-28 13:01:09] [INFO ] Computing symmetric may disable matrix : 1049 transitions.
[2024-05-28 13:01:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:01:09] [INFO ] Computing symmetric may enable matrix : 1049 transitions.
[2024-05-28 13:01:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:01:09] [INFO ] Applying decomposition
[2024-05-28 13:01:09] [INFO ] Flatten gal took : 24 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/graph15037101590057050123.txt' '-o' '/tmp/graph15037101590057050123.bin' '-w' '/tmp/graph15037101590057050123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15037101590057050123.bin' '-l' '-1' '-v' '-w' '/tmp/graph15037101590057050123.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:01:09] [INFO ] Decomposing Gal with order
[2024-05-28 13:01:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:01:09] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 13:01:09] [INFO ] Computing Do-Not-Accords matrix : 1049 transitions.
[2024-05-28 13:01:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 13:01:09] [INFO ] Flatten gal took : 52 ms
[2024-05-28 13:01:09] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12955603288308538755
Running compilation step : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 13:01:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 13:01:09] [INFO ] Time to serialize gal into /tmp/LTLFireability14615030785629289987.gal : 35 ms
[2024-05-28 13:01:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9783080252988823932.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14615030785629289987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9783080252988823932.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((F((G("((i15.i3.u295.p875==1)&&(i16.i2.u312.p926==1))"))||((X(X(!("((i15.i3.u295.p875==1)&&(i16.i2.u312.p926==1))"))))U(((X(X(!("((i...326
Formula 0 simplified : G(F!"((i15.i3.u295.p875==1)&&(i16.i2.u312.p926==1))" & (XX"((i15.i3.u295.p875==1)&&(i16.i2.u312.p926==1))" R (XXF"((i15.i3.u295.p875...289
Compilation finished in 3588 ms.
Running link step : cd /tmp/ltsmin12955603288308538755;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U ((X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U ((X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp4==true)||X((LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp4==true)||X((LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin12955603288308538755;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||(X(X(!(LTLAPp0==true))) U ((X(X(!(LTLAPp0==true)))&&[](!(LTLAPp1==true)))||X(X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-28 13:19:47] [INFO ] Applying decomposition
[2024-05-28 13:19:47] [INFO ] Flatten gal took : 73 ms
[2024-05-28 13:19:47] [INFO ] Decomposing Gal with order
[2024-05-28 13:19:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:19:47] [INFO ] Removed a total of 320 redundant transitions.
[2024-05-28 13:19:47] [INFO ] Flatten gal took : 128 ms
[2024-05-28 13:19:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 66 ms.
[2024-05-28 13:19:48] [INFO ] Time to serialize gal into /tmp/LTLFireability11717156857553391616.gal : 35 ms
[2024-05-28 13:19:48] [INFO ] Time to serialize properties into /tmp/LTLFireability12256799595713450407.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11717156857553391616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12256799595713450407.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F((G("((i0.i0.i0.i0.i0.i1.i0.i0.i0.u272.p875==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u287.p926==1))"))||((X(X(!("((i0.i0.i0.i0.i0.i1.i0...630
Formula 0 simplified : G(F!"((i0.i0.i0.i0.i0.i1.i0.i0.i0.u272.p875==1)&&(i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u287.p926==1))" & (XX"((i0.i0.i0.i0.i0.i1.i0.i0.i0.u...593
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPs-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;