About the Execution of ITS-Tools for ASLink-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14481.176 | 3600000.00 | 13345807.00 | 1603.90 | ?FTFTFFFTFFFFTFF | 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.r004-smll-171620117700028.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 ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 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 ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716220388947
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 15:53:11] [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-20 15:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:53:12] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2024-05-20 15:53:12] [INFO ] Transformed 626 places.
[2024-05-20 15:53:12] [INFO ] Transformed 1008 transitions.
[2024-05-20 15:53:12] [INFO ] Found NUPN structural information;
[2024-05-20 15:53:12] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 699 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 998
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 609 transition count 982
Ensure Unique test removed 1 places
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 608 transition count 982
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 608 transition count 980
Applied a total of 26 rules in 226 ms. Remains 608 /626 variables (removed 18) and now considering 980/998 (removed 18) transitions.
// Phase 1: matrix 980 rows 608 cols
[2024-05-20 15:53:13] [INFO ] Computed 106 invariants in 88 ms
[2024-05-20 15:53:14] [INFO ] Implicit Places using invariants in 1395 ms returned [1, 23, 33, 51, 69, 198, 215, 220, 221, 222, 240, 258, 387, 392, 404, 409, 410, 411, 448, 451, 469, 470, 471, 472, 489, 497, 505, 511, 517, 523, 529, 537, 543, 549, 557]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1460 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 573/626 places, 980/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 560 transition count 967
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 560 transition count 967
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 550 transition count 957
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 550 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 545 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 545 transition count 952
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 543 transition count 950
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 543 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 541 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 541 transition count 948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 540 transition count 947
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 540 transition count 947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 539 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 539 transition count 946
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 538 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 538 transition count 945
Applied a total of 70 rules in 473 ms. Remains 538 /573 variables (removed 35) and now considering 945/980 (removed 35) transitions.
// Phase 1: matrix 945 rows 538 cols
[2024-05-20 15:53:14] [INFO ] Computed 71 invariants in 20 ms
[2024-05-20 15:53:15] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-20 15:53:15] [INFO ] Invariant cache hit.
[2024-05-20 15:53:17] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 538/626 places, 945/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4560 ms. Remains : 538/626 places, 945/998 transitions.
Support contains 47 out of 538 places after structural reductions.
[2024-05-20 15:53:17] [INFO ] Flatten gal took : 158 ms
[2024-05-20 15:53:17] [INFO ] Flatten gal took : 94 ms
[2024-05-20 15:53:17] [INFO ] Input system was already deterministic with 945 transitions.
Support contains 45 out of 538 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (446 resets) in 2983 ms. (13 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40003 steps (142 resets) in 307 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (128 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (126 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (133 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (135 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (134 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (131 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (132 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (123 resets) in 137 ms. (289 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (134 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (126 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (130 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (130 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
[2024-05-20 15:53:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 175/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 80/282 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 256/538 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 15:53:20] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 30 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 945/1483 variables, 538/610 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 15:53:22] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 3 ms to minimize.
[2024-05-20 15:53:22] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/1483 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 612 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3456 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 175/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 80/282 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 15:53:23] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 256/538 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 15:53:24] [INFO ] Deduced a trap composed of 65 places in 305 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 11 (OVERLAPS) 945/1483 variables, 538/614 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1483 variables, 6/620 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/620 constraints. Problems are: Problem set: 7 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 620 constraints, problems are : Problem set: 7 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 8542ms problems are : Problem set: 7 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 538 transition count 862
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 455 transition count 862
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 166 place count 455 transition count 799
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 313 place count 371 transition count 799
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 2 rules applied. Total rules applied 315 place count 370 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 369 transition count 798
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 316 place count 369 transition count 790
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 332 place count 361 transition count 790
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 335 place count 358 transition count 779
Iterating global reduction 4 with 3 rules applied. Total rules applied 338 place count 358 transition count 779
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 355 place count 354 transition count 766
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 368 place count 341 transition count 766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 368 place count 341 transition count 765
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 370 place count 340 transition count 765
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 374 place count 336 transition count 754
Iterating global reduction 6 with 4 rules applied. Total rules applied 378 place count 336 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 381 place count 336 transition count 751
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 382 place count 335 transition count 743
Iterating global reduction 7 with 1 rules applied. Total rules applied 383 place count 335 transition count 743
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 384 place count 334 transition count 735
Iterating global reduction 7 with 1 rules applied. Total rules applied 385 place count 334 transition count 735
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 386 place count 333 transition count 727
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 333 transition count 727
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 388 place count 332 transition count 719
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 332 transition count 719
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 390 place count 331 transition count 711
Iterating global reduction 7 with 1 rules applied. Total rules applied 391 place count 331 transition count 711
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 392 place count 330 transition count 703
Iterating global reduction 7 with 1 rules applied. Total rules applied 393 place count 330 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 394 place count 329 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 395 place count 329 transition count 695
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 396 place count 328 transition count 687
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 328 transition count 687
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 398 place count 327 transition count 679
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 327 transition count 679
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 400 place count 326 transition count 671
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 326 transition count 671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 402 place count 325 transition count 663
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 325 transition count 663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 324 transition count 655
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 324 transition count 655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 323 transition count 647
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 323 transition count 647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 408 place count 322 transition count 639
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 322 transition count 639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 410 place count 321 transition count 631
Iterating global reduction 7 with 1 rules applied. Total rules applied 411 place count 321 transition count 631
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 6 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 463 place count 295 transition count 605
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 464 place count 295 transition count 604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 465 place count 294 transition count 604
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 476 place count 294 transition count 593
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 488 place count 282 transition count 593
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 489 place count 282 transition count 592
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 496 place count 282 transition count 592
Applied a total of 496 rules in 532 ms. Remains 282 /538 variables (removed 256) and now considering 592/945 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 282/538 places, 592/945 transitions.
RANDOM walk for 40000 steps (900 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (336 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (301 resets) in 98 ms. (404 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (329 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (290 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
// Phase 1: matrix 592 rows 282 cols
[2024-05-20 15:53:29] [INFO ] Computed 44 invariants in 6 ms
[2024-05-20 15:53:29] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/87 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 171/258 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 24/282 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 592/874 variables, 282/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/874 variables, 10/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/874 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/874 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 336 constraints, problems are : Problem set: 0 solved, 3 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/87 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 171/258 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 24/282 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 10 (OVERLAPS) 592/874 variables, 282/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/874 variables, 10/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/874 variables, 2/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/874 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/874 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 874/874 variables, and 338 constraints, problems are : Problem set: 1 solved, 2 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 1045 ms.
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 592/592 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 281 transition count 591
Applied a total of 2 rules in 37 ms. Remains 281 /282 variables (removed 1) and now considering 591/592 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 281/282 places, 591/592 transitions.
RANDOM walk for 40000 steps (849 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (319 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (291 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 45357 steps, run visited all 2 properties in 267 ms. (steps per millisecond=169 )
Probabilistic random walk after 45357 steps, saw 29934 distinct states, run finished after 275 ms. (steps per millisecond=164 ) properties seen :2
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-02a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Applied a total of 1 rules in 17 ms. Remains 537 /538 variables (removed 1) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 537 cols
[2024-05-20 15:53:32] [INFO ] Computed 70 invariants in 13 ms
[2024-05-20 15:53:33] [INFO ] Implicit Places using invariants in 723 ms returned [18, 19, 427]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 729 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 534/538 places, 945/945 transitions.
Applied a total of 0 rules in 15 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 762 ms. Remains : 534/538 places, 945/945 transitions.
Stuttering acceptance computed with spot in 694 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-00
Product exploration explored 100000 steps with 1560 reset in 661 ms.
Product exploration explored 100000 steps with 1580 reset in 481 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (462 resets) in 1052 ms. (37 steps per ms) remains 9/16 properties
BEST_FIRST walk for 40003 steps (129 resets) in 266 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (125 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (133 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (132 resets) in 522 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (130 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (127 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (137 resets) in 121 ms. (327 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (139 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (133 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
// Phase 1: matrix 945 rows 534 cols
[2024-05-20 15:53:36] [INFO ] Computed 67 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 149/268 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 5 (OVERLAPS) 265/533 variables, 48/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 945/1479 variables, 534/601 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1479/1479 variables, and 601 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 149/268 variables, 14/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 265/533 variables, 48/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 15:53:38] [INFO ] Deduced a trap composed of 51 places in 397 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/534 variables, 1/68 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/68 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 945/1479 variables, 534/602 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1479 variables, 4/606 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1479 variables, 0/606 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1479 variables, 0/606 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1479/1479 variables, and 606 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3259 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4369ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5940 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 855
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 444 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 443 transition count 854
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 182 place count 443 transition count 790
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 331 place count 358 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 2 rules applied. Total rules applied 333 place count 357 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 356 transition count 789
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 356 transition count 781
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 348 transition count 781
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 346 transition count 779
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 346 transition count 779
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 5 with 1 rules applied. Total rules applied 355 place count 346 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 345 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 356 place count 345 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 344 transition count 777
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 436 place count 305 transition count 738
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 305 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 304 transition count 737
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 444 place count 304 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 450 place count 298 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 451 place count 298 transition count 730
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 462 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 297 transition count 729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 295 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 465 place count 295 transition count 725
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 475 place count 289 transition count 725
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 477 place count 287 transition count 723
Iterating global reduction 10 with 2 rules applied. Total rules applied 479 place count 287 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 287 transition count 721
Applied a total of 481 rules in 163 ms. Remains 287 /534 variables (removed 247) and now considering 721/945 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 287/534 places, 721/945 transitions.
RANDOM walk for 40000 steps (826 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (306 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (279 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (329 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (324 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
// Phase 1: matrix 721 rows 287 cols
[2024-05-20 15:53:47] [INFO ] Computed 41 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 126/180 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/200 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 73/273 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/278 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/279 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/287 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 721/1008 variables, 287/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1008 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1008 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 328 constraints, problems are : Problem set: 0 solved, 3 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 126/180 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 20/200 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 73/273 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/278 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/279 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/287 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 721/1008 variables, 287/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1008 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 15:53:49] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1008 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1008 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 332 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2281ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2070 ms.
Support contains 7 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 transitions.
Applied a total of 0 rules in 11 ms. Remains 287 /287 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 287/287 places, 721/721 transitions.
RANDOM walk for 40000 steps (789 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (296 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (323 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (310 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 503295 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :2 out of 3
Probabilistic random walk after 503295 steps, saw 197557 distinct states, run finished after 3007 ms. (steps per millisecond=167 ) properties seen :2
[2024-05-20 15:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/177 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:53:55] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/197 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/273 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/278 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/287 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 721/1008 variables, 287/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/177 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/197 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/273 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/278 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/287 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 721/1008 variables, 287/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1008 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1008 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 6 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 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 287 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 719
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 719
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 284 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 283 transition count 718
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 283 transition count 717
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 282 transition count 716
Applied a total of 10 rules in 58 ms. Remains 282 /287 variables (removed 5) and now considering 716/721 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 282/287 places, 716/721 transitions.
RANDOM walk for 40000 steps (858 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (337 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428746 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428746 steps, saw 200563 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 716 rows 282 cols
[2024-05-20 15:53:59] [INFO ] Computed 40 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/175 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:53:59] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/195 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/268 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/273 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/274 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/282 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 716/998 variables, 282/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/998 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/998 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/175 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/195 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/268 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/273 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/274 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/282 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 716/998 variables, 282/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/998 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/998 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/998 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1153ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 282/282 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-20 15:54:01] [INFO ] Invariant cache hit.
[2024-05-20 15:54:01] [INFO ] Implicit Places using invariants in 545 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 266, 269, 273, 276, 279]
[2024-05-20 15:54:01] [INFO ] Actually due to overlaps returned [187, 88, 94, 99, 175, 181, 186, 266, 273, 276, 279, 71, 100, 158, 269]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 549 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/282 places, 716/716 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 267 transition count 712
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 263 transition count 712
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 19 place count 252 transition count 699
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 252 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 252 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 250 transition count 695
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 250 transition count 695
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 245 transition count 690
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 53 place count 245 transition count 683
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 60 place count 238 transition count 683
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 238 transition count 681
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 236 transition count 681
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 236 transition count 681
Applied a total of 65 rules in 62 ms. Remains 236 /267 variables (removed 31) and now considering 681/716 (removed 35) transitions.
// Phase 1: matrix 681 rows 236 cols
[2024-05-20 15:54:01] [INFO ] Computed 25 invariants in 5 ms
[2024-05-20 15:54:02] [INFO ] Implicit Places using invariants in 395 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 400 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 234/282 places, 681/716 transitions.
Applied a total of 0 rules in 13 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1037 ms. Remains : 234/282 places, 681/716 transitions.
RANDOM walk for 40000 steps (853 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 574712 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 574712 steps, saw 250964 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 681 rows 234 cols
[2024-05-20 15:54:05] [INFO ] Computed 23 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/171 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/201 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/234 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 681/915 variables, 234/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/915 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/915 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:54:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/171 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/201 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/234 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 681/915 variables, 234/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/915 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/915 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 915/915 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 681/681 transitions.
Applied a total of 0 rules in 13 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 234/234 places, 681/681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 681/681 transitions.
Applied a total of 0 rules in 13 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-20 15:54:06] [INFO ] Invariant cache hit.
[2024-05-20 15:54:06] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-20 15:54:06] [INFO ] Invariant cache hit.
[2024-05-20 15:54:07] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
[2024-05-20 15:54:07] [INFO ] Redundant transitions in 46 ms returned []
Running 666 sub problems to find dead transitions.
[2024-05-20 15:54:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-20 15:54:31] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 4 ms to minimize.
[2024-05-20 15:54:31] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2024-05-20 15:54:34] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
[2024-05-20 15:54:35] [INFO ] Deduced a trap composed of 78 places in 274 ms of which 5 ms to minimize.
Problem TDEAD656 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.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 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/915 variables, and 27 constraints, problems are : Problem set: 7 solved, 659 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 13/17 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/20 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/23 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 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 TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 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 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
At refinement iteration 7 (OVERLAPS) 681/915 variables, 234/261 constraints. Problems are: Problem set: 203 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 724 constraints, problems are : Problem set: 203 solved, 463 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 463/666 constraints, Known Traps: 4/4 constraints]
After SMT, in 61067ms problems are : Problem set: 203 solved, 463 unsolved
Search for dead transitions found 203 dead transitions in 61084ms
Found 203 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 203 transitions
Dead transitions reduction (with SMT) removed 203 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/234 places, 478/681 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-05-20 15:55:08] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62788 ms. Remains : 234/234 places, 478/681 transitions.
RANDOM walk for 40000 steps (867 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (321 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 690920 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 690920 steps, saw 290953 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
// Phase 1: matrix 478 rows 234 cols
[2024-05-20 15:55:12] [INFO ] Computed 24 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/167 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/196 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:55:12] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 3 ms to minimize.
[2024-05-20 15:55:12] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-05-20 15:55:12] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-20 15:55:12] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/200 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 478/712 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/712 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/712 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 234/234 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:55:13] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 127/167 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/196 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/200 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/234 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 478/712 variables, 234/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/712 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/712 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/712 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 712/712 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 478/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 234/234 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 478/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-05-20 15:55:13] [INFO ] Invariant cache hit.
[2024-05-20 15:55:14] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-20 15:55:14] [INFO ] Invariant cache hit.
[2024-05-20 15:55:15] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned [1, 21, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136]
Discarding 29 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 1374 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/234 places, 476/478 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 205 transition count 474
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 203 transition count 474
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 17 place count 203 transition count 472
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 30 place count 190 transition count 472
Applied a total of 30 rules in 26 ms. Remains 190 /205 variables (removed 15) and now considering 472/476 (removed 4) transitions.
// Phase 1: matrix 472 rows 190 cols
[2024-05-20 15:55:15] [INFO ] Computed 18 invariants in 12 ms
[2024-05-20 15:55:15] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-20 15:55:15] [INFO ] Invariant cache hit.
[2024-05-20 15:55:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 15:55:16] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 190/234 places, 472/478 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2602 ms. Remains : 190/234 places, 472/478 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p3) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p2))), (F p1), (F (NOT (OR p1 (NOT p3) p2))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p3), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 770 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 945/945 transitions.
Applied a total of 0 rules in 13 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 534 cols
[2024-05-20 15:55:18] [INFO ] Computed 67 invariants in 16 ms
[2024-05-20 15:55:18] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-20 15:55:18] [INFO ] Invariant cache hit.
[2024-05-20 15:55:20] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2720 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-05-20 15:55:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
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 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.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 16.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 6.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 16.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 7.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 5.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 2.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 2.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 41.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 16.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 11.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 11.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 17.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 5.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 2.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 6.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 22.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 20.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1479 variables, and 44 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 44/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-05-20 15:56:19] [INFO ] Deduced a trap composed of 79 places in 519 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1479 variables, and 68 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 1/1 constraints]
After SMT, in 60905ms problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Finished structural reductions in LTL mode , in 1 iterations and 63654 ms. Remains : 534/534 places, 945/945 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
RANDOM walk for 40000 steps (444 resets) in 257 ms. (155 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (125 resets) in 98 ms. (404 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (130 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (130 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (130 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (135 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
[2024-05-20 15:56:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 149/268 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 265/533 variables, 48/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 945/1479 variables, 534/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1479/1479 variables, and 601 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-20 15:56:24] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 149/268 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 265/533 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-20 15:56:24] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/534 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 945/1479 variables, 534/603 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1479 variables, 6/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1479 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1479 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1479/1479 variables, and 609 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3533 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 4794ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 11937 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 855
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 444 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 443 transition count 854
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 182 place count 443 transition count 790
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 331 place count 358 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 2 rules applied. Total rules applied 333 place count 357 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 356 transition count 789
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 356 transition count 781
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 348 transition count 781
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 346 transition count 779
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 346 transition count 779
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 5 with 1 rules applied. Total rules applied 355 place count 346 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 345 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 356 place count 345 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 344 transition count 777
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 436 place count 305 transition count 738
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 305 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 304 transition count 737
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 444 place count 304 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 450 place count 298 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 451 place count 298 transition count 730
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 462 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 297 transition count 729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 295 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 465 place count 295 transition count 725
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 475 place count 289 transition count 725
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 477 place count 287 transition count 723
Iterating global reduction 10 with 2 rules applied. Total rules applied 479 place count 287 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 287 transition count 721
Applied a total of 481 rules in 134 ms. Remains 287 /534 variables (removed 247) and now considering 721/945 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 287/534 places, 721/945 transitions.
RANDOM walk for 40000 steps (806 resets) in 1030 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (280 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (316 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (312 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (332 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (307 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (317 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 395326 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :5 out of 6
Probabilistic random walk after 395326 steps, saw 165960 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :5
// Phase 1: matrix 721 rows 287 cols
[2024-05-20 15:56:43] [INFO ] Computed 41 invariants in 15 ms
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) 39/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/177 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/197 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/273 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/278 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/287 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 721/1008 variables, 287/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:56:44] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1008 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 39/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:56:44] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 125/177 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/273 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/278 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/279 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/279 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/287 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/287 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 721/1008 variables, 287/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1008 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1008 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1008 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1587ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 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 287 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 719
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 719
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 284 transition count 719
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 282 transition count 717
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 282 transition count 716
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 12 place count 281 transition count 715
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 17 place count 281 transition count 710
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 27 place count 271 transition count 710
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 31 place count 267 transition count 698
Iterating global reduction 5 with 4 rules applied. Total rules applied 35 place count 267 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 38 place count 267 transition count 695
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 39 place count 266 transition count 687
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 266 transition count 687
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 41 place count 265 transition count 679
Iterating global reduction 6 with 1 rules applied. Total rules applied 42 place count 265 transition count 679
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 43 place count 264 transition count 671
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 264 transition count 671
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 45 place count 263 transition count 663
Iterating global reduction 6 with 1 rules applied. Total rules applied 46 place count 263 transition count 663
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 47 place count 262 transition count 655
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 262 transition count 655
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 49 place count 261 transition count 647
Iterating global reduction 6 with 1 rules applied. Total rules applied 50 place count 261 transition count 647
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 51 place count 260 transition count 639
Iterating global reduction 6 with 1 rules applied. Total rules applied 52 place count 260 transition count 639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 53 place count 259 transition count 631
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 259 transition count 631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 55 place count 258 transition count 623
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 258 transition count 623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 57 place count 257 transition count 615
Iterating global reduction 6 with 1 rules applied. Total rules applied 58 place count 257 transition count 615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 59 place count 256 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 256 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 255 transition count 599
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 255 transition count 599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 254 transition count 591
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 254 transition count 591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 253 transition count 583
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 253 transition count 583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 67 place count 252 transition count 575
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 252 transition count 575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 69 place count 251 transition count 567
Iterating global reduction 6 with 1 rules applied. Total rules applied 70 place count 251 transition count 567
Applied a total of 70 rules in 255 ms. Remains 251 /287 variables (removed 36) and now considering 567/721 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 251/287 places, 567/721 transitions.
RANDOM walk for 40000 steps (848 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (346 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 493543 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493543 steps, saw 202931 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 567 rows 251 cols
[2024-05-20 15:56:48] [INFO ] Computed 35 invariants in 5 ms
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) 95/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/151 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/237 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/242 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/243 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/251 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 567/818 variables, 251/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/818 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/818 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 251/251 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) 95/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/151 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/237 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/242 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/243 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/251 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 567/818 variables, 251/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/818 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/818 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/818 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 961ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 567/567 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 251/251 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2024-05-20 15:56:49] [INFO ] Invariant cache hit.
[2024-05-20 15:56:50] [INFO ] Implicit Places using invariants in 497 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187]
[2024-05-20 15:56:50] [INFO ] Actually due to overlaps returned [187, 88, 94, 99, 175, 181, 186, 71, 100, 158]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 500 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 241/251 places, 567/567 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 558
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 558
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 230 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 230 transition count 556
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 30 place count 226 transition count 552
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 226 transition count 546
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 220 transition count 546
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 220 transition count 544
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 218 transition count 544
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 218 transition count 544
Applied a total of 47 rules in 47 ms. Remains 218 /241 variables (removed 23) and now considering 544/567 (removed 23) transitions.
// Phase 1: matrix 544 rows 218 cols
[2024-05-20 15:56:50] [INFO ] Computed 25 invariants in 10 ms
[2024-05-20 15:56:50] [INFO ] Implicit Places using invariants in 381 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 383 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 216/251 places, 544/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 216 /216 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 947 ms. Remains : 216/251 places, 544/567 transitions.
RANDOM walk for 40000 steps (825 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 580632 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 1
Probabilistic random walk after 580632 steps, saw 252366 distinct states, run finished after 3002 ms. (steps per millisecond=193 ) properties seen :0
// Phase 1: matrix 544 rows 216 cols
[2024-05-20 15:56:53] [INFO ] Computed 23 invariants in 5 ms
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) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/153 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/183 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/216 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 544/760 variables, 216/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/760 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 216/216 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) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:56:54] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/153 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/183 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/216 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 544/760 variables, 216/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/760 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/760 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/760 variables, and 241 constraints, problems are : Problem set: 0 solved, 1 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 544/544 transitions.
Applied a total of 0 rules in 10 ms. Remains 216 /216 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 216/216 places, 544/544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 544/544 transitions.
Applied a total of 0 rules in 11 ms. Remains 216 /216 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2024-05-20 15:56:55] [INFO ] Invariant cache hit.
[2024-05-20 15:56:55] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-20 15:56:55] [INFO ] Invariant cache hit.
[2024-05-20 15:56:56] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-20 15:56:56] [INFO ] Redundant transitions in 5 ms returned []
Running 530 sub problems to find dead transitions.
[2024-05-20 15:56:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (OVERLAPS) 1/216 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 530 unsolved
[2024-05-20 15:57:15] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-20 15:57:16] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30497ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31793 ms. Remains : 216/216 places, 544/544 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 216 /216 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-20 15:57:26] [INFO ] Invariant cache hit.
[2024-05-20 15:57:26] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-20 15:57:26] [INFO ] [Real]Absence check using 7 positive and 16 generalized place invariants in 16 ms returned sat
[2024-05-20 15:57:27] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:57:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-20 15:57:27] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 15 ms returned sat
[2024-05-20 15:57:27] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 15:57:27] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:57:27] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1127 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3) p2))), (F p2), (F p3), (F (NOT (OR p0 p1 (NOT p3)))), (F p1), (F (NOT (OR p1 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 628 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Product exploration explored 100000 steps with 1526 reset in 367 ms.
Product exploration explored 100000 steps with 1545 reset in 349 ms.
Built C files in :
/tmp/ltsmin12910738168121027606
[2024-05-20 15:57:30] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12910738168121027606
Running compilation step : cd /tmp/ltsmin12910738168121027606;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12910738168121027606;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12910738168121027606;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 534 cols
[2024-05-20 15:57:34] [INFO ] Computed 67 invariants in 12 ms
[2024-05-20 15:57:34] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-20 15:57:34] [INFO ] Invariant cache hit.
[2024-05-20 15:57:36] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-05-20 15:57:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
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 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.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 16.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 6.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 16.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 7.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 5.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 2.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 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/1479 variables, and 44 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 44/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-05-20 15:58:37] [INFO ] Deduced a trap composed of 79 places in 518 ms of which 7 ms to minimize.
SMT process timed out in 60867ms, After SMT, problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 60884ms
Finished structural reductions in LTL mode , in 1 iterations and 63768 ms. Remains : 534/534 places, 945/945 transitions.
Built C files in :
/tmp/ltsmin7249340092579219854
[2024-05-20 15:58:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7249340092579219854
Running compilation step : cd /tmp/ltsmin7249340092579219854;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7249340092579219854;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7249340092579219854;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 15:58:41] [INFO ] Flatten gal took : 99 ms
[2024-05-20 15:58:41] [INFO ] Flatten gal took : 88 ms
[2024-05-20 15:58:41] [INFO ] Time to serialize gal into /tmp/LTL13833025744910449397.gal : 18 ms
[2024-05-20 15:58:41] [INFO ] Time to serialize properties into /tmp/LTL1086758460424087720.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/LTL13833025744910449397.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15667216040929214772.hoa' '-atoms' '/tmp/LTL1086758460424087720.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/LTL1086758460424087720.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15667216040929214772.hoa
Detected timeout of ITS tools.
[2024-05-20 15:58:56] [INFO ] Flatten gal took : 47 ms
[2024-05-20 15:58:56] [INFO ] Flatten gal took : 46 ms
[2024-05-20 15:58:56] [INFO ] Time to serialize gal into /tmp/LTL13211558926983881246.gal : 15 ms
[2024-05-20 15:58:56] [INFO ] Time to serialize properties into /tmp/LTL15221128032917777787.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13211558926983881246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15221128032917777787.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(X((G("(p386==0)"))||(G(F((!("((p425==1)&&(p593==1))"))U((G(!("((p425==1)&&(p593==1))")))||((!("((p425==1)&&(p593==1))"))&&((X(!("...294
Formula 0 simplified : XX(F!"(p386==0)" & FG((X"((p408==1)&&(p477==1))" R (XF"((p408==1)&&(p477==1))" & ("((p16==1)&&(p87==1))" | X"((p408==1)&&(p477==1))"...187
Detected timeout of ITS tools.
[2024-05-20 15:59:11] [INFO ] Flatten gal took : 39 ms
[2024-05-20 15:59:11] [INFO ] Applying decomposition
[2024-05-20 15:59:11] [INFO ] Flatten gal took : 41 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/graph6752886947074815931.txt' '-o' '/tmp/graph6752886947074815931.bin' '-w' '/tmp/graph6752886947074815931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6752886947074815931.bin' '-l' '-1' '-v' '-w' '/tmp/graph6752886947074815931.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:59:11] [INFO ] Decomposing Gal with order
[2024-05-20 15:59:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:59:12] [INFO ] Removed a total of 1521 redundant transitions.
[2024-05-20 15:59:12] [INFO ] Flatten gal took : 230 ms
[2024-05-20 15:59:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 65 ms.
[2024-05-20 15:59:12] [INFO ] Time to serialize gal into /tmp/LTL12281234994357811900.gal : 32 ms
[2024-05-20 15:59:12] [INFO ] Time to serialize properties into /tmp/LTL14858882820396529286.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/LTL12281234994357811900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14858882820396529286.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("(i6.i1.i0.u116.p386==0)"))||(G(F((!("((i9.u125.p425==1)&&(i11.u169.p593==1))"))U((G(!("((i9.u125.p425==1)&&(i11.u169.p593==...420
Formula 0 simplified : XX(F!"(i6.i1.i0.u116.p386==0)" & FG((X"((i7.u120.p408==1)&&(i7.u146.p477==1))" R (XF"((i7.u120.p408==1)&&(i7.u146.p477==1))" & ("((i...279
Detected timeout of ITS tools.
Treatment of property ASLink-PT-02a-LTLFireability-00 finished in 355085 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 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 5 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 7 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 8 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 8 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 8 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 8 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 8 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 8 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 510 place count 268 transition count 583
Applied a total of 510 rules in 206 ms. Remains 268 /538 variables (removed 270) and now considering 583/945 (removed 362) transitions.
// Phase 1: matrix 583 rows 268 cols
[2024-05-20 15:59:27] [INFO ] Computed 38 invariants in 6 ms
[2024-05-20 15:59:28] [INFO ] Implicit Places using invariants in 474 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 265]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 476 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/538 places, 583/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 253 transition count 581
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 253 transition count 579
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 251 transition count 579
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 247 transition count 575
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 247 transition count 575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 243 transition count 571
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 243 transition count 571
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 241 transition count 569
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 241 transition count 569
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 230 transition count 558
Applied a total of 50 rules in 58 ms. Remains 230 /255 variables (removed 25) and now considering 558/583 (removed 25) transitions.
// Phase 1: matrix 558 rows 230 cols
[2024-05-20 15:59:28] [INFO ] Computed 25 invariants in 7 ms
[2024-05-20 15:59:28] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-20 15:59:28] [INFO ] Invariant cache hit.
[2024-05-20 15:59:29] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/538 places, 558/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1944 ms. Remains : 230/538 places, 558/945 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-01 finished in 2010 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)||G(p1))&&X(G(!p2))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 264 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 520 cols
[2024-05-20 15:59:29] [INFO ] Computed 70 invariants in 5 ms
[2024-05-20 15:59:30] [INFO ] Implicit Places using invariants in 532 ms returned [19, 410]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 533 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 518/538 places, 808/945 transitions.
Applied a total of 0 rules in 9 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 807 ms. Remains : 518/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), p2, (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-03
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-03 finished in 992 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)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 148 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
[2024-05-20 15:59:30] [INFO ] Invariant cache hit.
[2024-05-20 15:59:31] [INFO ] Implicit Places using invariants in 481 ms returned [18, 19, 410]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 483 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/538 places, 808/945 transitions.
Applied a total of 0 rules in 8 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 639 ms. Remains : 517/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-07
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-07 finished in 722 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)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 536 transition count 857
Reduce places removed 89 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 179 place count 447 transition count 855
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 445 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 6 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 8 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 9 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 508 place count 269 transition count 584
Applied a total of 508 rules in 127 ms. Remains 269 /538 variables (removed 269) and now considering 584/945 (removed 361) transitions.
// Phase 1: matrix 584 rows 269 cols
[2024-05-20 15:59:31] [INFO ] Computed 38 invariants in 4 ms
[2024-05-20 15:59:31] [INFO ] Implicit Places using invariants in 351 ms returned [17, 18, 77, 94, 100, 106, 165, 182, 188, 193, 195, 224, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 353 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/538 places, 584/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 256 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 254 transition count 580
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 252 transition count 580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 248 transition count 576
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 248 transition count 576
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 244 transition count 572
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 244 transition count 572
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 242 transition count 570
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 242 transition count 570
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 231 transition count 559
Applied a total of 50 rules in 27 ms. Remains 231 /256 variables (removed 25) and now considering 559/584 (removed 25) transitions.
// Phase 1: matrix 559 rows 231 cols
[2024-05-20 15:59:31] [INFO ] Computed 25 invariants in 4 ms
[2024-05-20 15:59:32] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-20 15:59:32] [INFO ] Invariant cache hit.
[2024-05-20 15:59:32] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/538 places, 559/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1487 ms. Remains : 231/538 places, 559/945 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-09
Product exploration explored 100000 steps with 2106 reset in 233 ms.
Stack based approach found an accepted trace after 87797 steps with 1882 reset with depth 14 and stack size 14 in 244 ms.
FORMULA ASLink-PT-02a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-09 finished in 2023 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)&&F(G(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 183 place count 444 transition count 787
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 338 place count 356 transition count 787
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 348 place count 351 transition count 782
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 346 transition count 782
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 353 place count 346 transition count 773
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 371 place count 337 transition count 773
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 376 place count 332 transition count 760
Iterating global reduction 5 with 5 rules applied. Total rules applied 381 place count 332 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 15 rules applied. Total rules applied 396 place count 328 transition count 749
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 13 rules applied. Total rules applied 409 place count 319 transition count 745
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 413 place count 315 transition count 745
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 413 place count 315 transition count 744
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 415 place count 314 transition count 744
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 419 place count 310 transition count 733
Iterating global reduction 8 with 4 rules applied. Total rules applied 423 place count 310 transition count 733
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 426 place count 310 transition count 730
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 427 place count 309 transition count 722
Iterating global reduction 9 with 1 rules applied. Total rules applied 428 place count 309 transition count 722
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 714
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 714
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 706
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 706
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 698
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 698
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 690
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 690
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 682
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 682
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 674
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 674
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 666
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 666
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 658
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 658
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 650
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 650
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 642
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 642
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 634
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 634
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 626
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 626
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 618
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 618
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 610
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 610
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 506 place count 270 transition count 585
Applied a total of 506 rules in 120 ms. Remains 270 /538 variables (removed 268) and now considering 585/945 (removed 360) transitions.
// Phase 1: matrix 585 rows 270 cols
[2024-05-20 15:59:33] [INFO ] Computed 38 invariants in 5 ms
[2024-05-20 15:59:33] [INFO ] Implicit Places using invariants in 358 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 360 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/538 places, 585/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 255 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 255 transition count 581
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 253 transition count 581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 249 transition count 577
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 249 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 245 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 245 transition count 573
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 243 transition count 571
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 243 transition count 571
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 232 transition count 560
Applied a total of 50 rules in 38 ms. Remains 232 /257 variables (removed 25) and now considering 560/585 (removed 25) transitions.
// Phase 1: matrix 560 rows 232 cols
[2024-05-20 15:59:33] [INFO ] Computed 25 invariants in 4 ms
[2024-05-20 15:59:34] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-20 15:59:34] [INFO ] Invariant cache hit.
[2024-05-20 15:59:34] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/538 places, 560/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1485 ms. Remains : 232/538 places, 560/945 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-11
Product exploration explored 100000 steps with 2194 reset in 175 ms.
Stack based approach found an accepted trace after 66029 steps with 1523 reset with depth 44 and stack size 44 in 131 ms.
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-11 finished in 2022 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 U (p2||G(!p1)))||p0))))'
Support contains 8 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 537 transition count 936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 537 transition count 936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 536 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 536 transition count 928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 535 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 535 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 534 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 534 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 533 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 533 transition count 904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 532 transition count 896
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 532 transition count 896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 531 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 530 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 530 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 529 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 529 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 528 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 528 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 527 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 527 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 526 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 526 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 525 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 525 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 524 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 524 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 523 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 523 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 522 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 522 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 521 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 521 transition count 808
Applied a total of 34 rules in 142 ms. Remains 521 /538 variables (removed 17) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 521 cols
[2024-05-20 15:59:35] [INFO ] Computed 71 invariants in 6 ms
[2024-05-20 15:59:35] [INFO ] Implicit Places using invariants in 514 ms returned [18, 411]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 516 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/538 places, 808/945 transitions.
Applied a total of 0 rules in 10 ms. Remains 519 /519 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 668 ms. Remains : 519/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 489 ms.
Product exploration explored 100000 steps with 50000 reset in 546 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 25 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-13 finished in 1834 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' '!(G((p0||G(p1))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 537 transition count 857
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 449 transition count 857
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 177 place count 449 transition count 794
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 323 place count 366 transition count 794
Discarding 2 places :
Implicit places reduction removed 2 places
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 2 with 3 rules applied. Total rules applied 326 place count 364 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 363 transition count 793
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 327 place count 363 transition count 785
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 343 place count 355 transition count 785
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 352 transition count 774
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 352 transition count 774
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 366 place count 348 transition count 761
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 379 place count 335 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 379 place count 335 transition count 760
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 334 transition count 760
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 385 place count 330 transition count 749
Iterating global reduction 6 with 4 rules applied. Total rules applied 389 place count 330 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 392 place count 330 transition count 746
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 329 transition count 738
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 329 transition count 738
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 328 transition count 730
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 328 transition count 730
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 397 place count 327 transition count 722
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 327 transition count 722
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 399 place count 326 transition count 714
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 326 transition count 714
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 401 place count 325 transition count 706
Iterating global reduction 7 with 1 rules applied. Total rules applied 402 place count 325 transition count 706
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 403 place count 324 transition count 698
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 324 transition count 698
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 405 place count 323 transition count 690
Iterating global reduction 7 with 1 rules applied. Total rules applied 406 place count 323 transition count 690
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 407 place count 322 transition count 682
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 322 transition count 682
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 409 place count 321 transition count 674
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 321 transition count 674
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 411 place count 320 transition count 666
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 320 transition count 666
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 413 place count 319 transition count 658
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 319 transition count 658
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 415 place count 318 transition count 650
Iterating global reduction 7 with 1 rules applied. Total rules applied 416 place count 318 transition count 650
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 417 place count 317 transition count 642
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 317 transition count 642
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 419 place count 316 transition count 634
Iterating global reduction 7 with 1 rules applied. Total rules applied 420 place count 316 transition count 634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 421 place count 315 transition count 626
Iterating global reduction 7 with 1 rules applied. Total rules applied 422 place count 315 transition count 626
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 472 place count 290 transition count 601
Applied a total of 472 rules in 119 ms. Remains 290 /538 variables (removed 248) and now considering 601/945 (removed 344) transitions.
// Phase 1: matrix 601 rows 290 cols
[2024-05-20 15:59:37] [INFO ] Computed 44 invariants in 4 ms
[2024-05-20 15:59:37] [INFO ] Implicit Places using invariants in 319 ms returned [18, 19, 95, 101, 106, 122, 193, 199, 204, 224, 242, 284, 287]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 321 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/538 places, 601/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 599
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 275 transition count 594
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 270 transition count 594
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 269 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 269 transition count 593
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 268 transition count 593
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 263 transition count 588
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 263 transition count 588
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 31 place count 259 transition count 584
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 259 transition count 584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 257 transition count 582
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 257 transition count 582
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 245 transition count 570
Applied a total of 63 rules in 35 ms. Remains 245 /277 variables (removed 32) and now considering 570/601 (removed 31) transitions.
// Phase 1: matrix 570 rows 245 cols
[2024-05-20 15:59:37] [INFO ] Computed 30 invariants in 4 ms
[2024-05-20 15:59:37] [INFO ] Implicit Places using invariants in 261 ms returned [94, 177, 180]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 263 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/538 places, 570/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 238 transition count 566
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 238 transition count 566
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 238 transition count 564
Applied a total of 10 rules in 15 ms. Remains 238 /242 variables (removed 4) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 238 cols
[2024-05-20 15:59:37] [INFO ] Computed 27 invariants in 4 ms
[2024-05-20 15:59:38] [INFO ] Implicit Places using invariants in 254 ms returned [73, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 257 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/538 places, 564/945 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 562
Applied a total of 4 rules in 13 ms. Remains 234 /236 variables (removed 2) and now considering 562/564 (removed 2) transitions.
// Phase 1: matrix 562 rows 234 cols
[2024-05-20 15:59:38] [INFO ] Computed 25 invariants in 5 ms
[2024-05-20 15:59:38] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-20 15:59:38] [INFO ] Invariant cache hit.
[2024-05-20 15:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 15:59:39] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 234/538 places, 562/945 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1987 ms. Remains : 234/538 places, 562/945 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 47 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-15 finished in 2134 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(p0)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
[2024-05-20 15:59:39] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11605836485072250105
[2024-05-20 15:59:39] [INFO ] Computing symmetric may disable matrix : 945 transitions.
[2024-05-20 15:59:39] [INFO ] Applying decomposition
[2024-05-20 15:59:39] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 15:59:39] [INFO ] Computing symmetric may enable matrix : 945 transitions.
[2024-05-20 15:59:39] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 15:59:39] [INFO ] Flatten gal took : 38 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/graph17565075723377864265.txt' '-o' '/tmp/graph17565075723377864265.bin' '-w' '/tmp/graph17565075723377864265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17565075723377864265.bin' '-l' '-1' '-v' '-w' '/tmp/graph17565075723377864265.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:59:39] [INFO ] Decomposing Gal with order
[2024-05-20 15:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:59:39] [INFO ] Removed a total of 1498 redundant transitions.
[2024-05-20 15:59:39] [INFO ] Computing Do-Not-Accords matrix : 945 transitions.
[2024-05-20 15:59:39] [INFO ] Flatten gal took : 75 ms
[2024-05-20 15:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 28 ms.
[2024-05-20 15:59:39] [INFO ] Computation of Completed DNA matrix. took 69 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 15:59:39] [INFO ] Time to serialize gal into /tmp/LTLFireability15045687271928686481.gal : 24 ms
[2024-05-20 15:59:39] [INFO ] Time to serialize properties into /tmp/LTLFireability9160107272507232712.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/LTLFireability15045687271928686481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9160107272507232712.ltl' '-c' '-stutter-deadlock'
[2024-05-20 15:59:39] [INFO ] Built C files in 360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11605836485072250105
Running compilation step : cd /tmp/ltsmin11605836485072250105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
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(X((G("(i5.i0.i1.u116.p386==0)"))||(G(F((!("((i10.u126.p425==1)&&(i11.u164.p593==1))"))U((G(!("((i10.u126.p425==1)&&(i11.u164.p593...423
Formula 0 simplified : XX(F!"(i5.i0.i1.u116.p386==0)" & FG((X"((i7.u121.p408==1)&&(i7.u146.p477==1))" R (XF"((i7.u121.p408==1)&&(i7.u146.p477==1))" & ("((i...280
Compilation finished in 5783 ms.
Running link step : cd /tmp/ltsmin11605836485072250105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin11605836485072250105;'/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(([]((LTLAPp0==true))||[](<>((!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(X(!(LTLAPp2==true)) U ((!(LTLAPp3==true)&&X(!(LTLAPp2==true)))||X([](!(LTLAPp2==true)))))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t16, t463, t465, t789, t842, t865, t915, i1.u39.t99, i1.u49.t109, i1....480
Computing Next relation with stutter on 2.10753e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-20 16:21:50] [INFO ] Applying decomposition
[2024-05-20 16:21:50] [INFO ] Flatten gal took : 95 ms
[2024-05-20 16:21:50] [INFO ] Decomposing Gal with order
[2024-05-20 16:21:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:21:50] [INFO ] Removed a total of 1198 redundant transitions.
[2024-05-20 16:21:51] [INFO ] Flatten gal took : 261 ms
[2024-05-20 16:21:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 85 ms.
[2024-05-20 16:21:51] [INFO ] Time to serialize gal into /tmp/LTLFireability6122106573004128061.gal : 21 ms
[2024-05-20 16:21:51] [INFO ] Time to serialize properties into /tmp/LTLFireability16896640524301621386.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/LTLFireability6122106573004128061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16896640524301621386.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 1 LTL properties
Checking formula 0 : !((X(X((G("(i14.u63.p386==0)"))||(G(F((!("((u74.p425==1)&&(i21.u105.p593==1))"))U((G(!("((u74.p425==1)&&(i21.u105.p593==1))")))||((!("...371
Formula 0 simplified : XX(F!"(i14.u63.p386==0)" & FG((X"((u70.p408==1)&&(u75.p477==1))" R (XF"((u70.p408==1)&&(u75.p477==1))" & ("((u1.p16==1)&&(u6.p87==1)...238
Reverse transition relation is NOT exact ! Due to transitions t417, t745, t755, t756, t759, t761, t764, t776, t780, t789, t839, t865, t918, i6.t5, i6.t4, i...497
Computing Next relation with stutter on 2.10753e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-20 16:44:01] [INFO ] Flatten gal took : 92 ms
[2024-05-20 16:44:01] [INFO ] Input system was already deterministic with 945 transitions.
[2024-05-20 16:44:02] [INFO ] Transformed 538 places.
[2024-05-20 16:44:02] [INFO ] Transformed 945 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 16:44:05] [INFO ] Time to serialize gal into /tmp/LTLFireability15016447722981873717.gal : 6 ms
[2024-05-20 16:44:05] [INFO ] Time to serialize properties into /tmp/LTLFireability10377694839770716778.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/LTLFireability15016447722981873717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10377694839770716778.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G("(p386==0)"))||(G(F((!("((p425==1)&&(p593==1))"))U((G(!("((p425==1)&&(p593==1))")))||((!("((p425==1)&&(p593==1))"))&&((X(!("...294
Formula 0 simplified : XX(F!"(p386==0)" & FG((X"((p408==1)&&(p477==1))" R (XF"((p408==1)&&(p477==1))" & ("((p16==1)&&(p87==1))" | X"((p408==1)&&(p477==1))"...187
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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r004-smll-171620117700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;