About the Execution of ITS-Tools for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.915 | 3600000.00 | 3227810.00 | 287081.20 | 1 1 1 1 1 1 1 1 4 2 ? ? 3 ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200773.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652943268711
Running Version 202205111006
[2022-05-19 06:54:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 06:54:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 06:54:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 06:54:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 06:54:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 640 ms
[2022-05-19 06:54:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-19 06:54:30] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2022-05-19 06:54:30] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 06:54:30] [INFO ] Computed 13 place invariants in 13 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 06:54:30] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-19 06:54:30] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-05-19 06:54:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 06:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-19 06:54:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 06:54:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 06:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-19 06:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:54:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 06:54:31] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 15 ms.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 06:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
[2022-05-19 06:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-19 06:54:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 06:54:31] [INFO ] Added : 15 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 06:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-19 06:54:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 06:54:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2022-05-19 06:54:31] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:54:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2022-05-19 06:54:31] [INFO ] Added : 36 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 17 ms.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 06:54:31] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2022-05-19 06:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-19 06:54:31] [INFO ] Added : 36 causal constraints over 8 iterations in 186 ms. Result :sat
Minimization took 21 ms.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:31] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-19 06:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 06:54:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 06:54:32] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 06:54:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2022-05-19 06:54:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 06:54:32] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2022-05-19 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-19 06:54:32] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 16 ms.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 06:54:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 06:54:32] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2022-05-19 06:54:32] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2022-05-19 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2022-05-19 06:54:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 06:54:32] [INFO ] Added : 36 causal constraints over 8 iterations in 118 ms. Result :sat
Minimization took 20 ms.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 06:54:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 06:54:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 06:54:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2022-05-19 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-19 06:54:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 06:54:32] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2022-05-19 06:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-19 06:54:32] [INFO ] Added : 36 causal constraints over 8 iterations in 164 ms. Result :sat
Minimization took 110 ms.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2022-05-19 06:54:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-19 06:54:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 06:54:33] [INFO ] Added : 20 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-19 06:54:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2022-05-19 06:54:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 06:54:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-05-19 06:54:33] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2022-05-19 06:54:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-19 06:54:33] [INFO ] Added : 24 causal constraints over 6 iterations in 412 ms. Result :sat
Minimization took 48 ms.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-19 06:54:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-19 06:54:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 06:54:34] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2022-05-19 06:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-19 06:54:34] [INFO ] Added : 36 causal constraints over 8 iterations in 167 ms. Result :sat
Minimization took 197 ms.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-05-19 06:54:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2022-05-19 06:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-19 06:54:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 06:54:34] [INFO ] Added : 21 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 75 ms.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 06:54:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 06:54:34] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-19 06:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-19 06:54:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 06:54:34] [INFO ] Added : 22 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 85 ms.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 06:54:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 06:54:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 06:54:34] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2022-05-19 06:54:34] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2022-05-19 06:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2022-05-19 06:54:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 06:54:34] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 16 ms.
[2022-05-19 06:54:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-19 06:54:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 06:54:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 06:54:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-19 06:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 06:54:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-19 06:54:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 06:54:35] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, -1, -1, -1, 1, 10, 2, 10, 10, 3, 4, -1, -1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 06:54:35] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 200 ms.
[2022-05-19 06:54:35] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 27 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :10
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-19 06:54:36] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-19 06:54:36] [INFO ] Computed 72 place invariants in 70 ms
[2022-05-19 06:54:36] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-19 06:54:36] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:36] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-19 06:54:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-19 06:54:36] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:37] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2022-05-19 06:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:54:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 86 ms returned sat
[2022-05-19 06:54:38] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 175 ms.
[2022-05-19 06:54:39] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 0 ms to minimize.
[2022-05-19 06:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1011 ms
[2022-05-19 06:54:40] [INFO ] Added : 42 causal constraints over 9 iterations in 2731 ms. Result :sat
Minimization took 609 ms.
[2022-05-19 06:54:41] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:41] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-05-19 06:54:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-19 06:54:41] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:42] [INFO ] [Nat]Absence check using state equation in 947 ms returned sat
[2022-05-19 06:54:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2022-05-19 06:54:43] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 374 ms.
[2022-05-19 06:54:44] [INFO ] Added : 30 causal constraints over 6 iterations in 1189 ms. Result :sat
Minimization took 611 ms.
[2022-05-19 06:54:44] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:44] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 06:54:44] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:44] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 4 ms returned unsat
[2022-05-19 06:54:45] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 06:54:45] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-19 06:54:45] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 06:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:45] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-05-19 06:54:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-19 06:54:45] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 06:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:46] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2022-05-19 06:54:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 279 ms returned sat
[2022-05-19 06:54:46] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 137 ms.
[2022-05-19 06:54:47] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2022-05-19 06:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 788 ms
[2022-05-19 06:54:48] [INFO ] Added : 32 causal constraints over 7 iterations in 1636 ms. Result :sat
Minimization took 2389 ms.
[2022-05-19 06:54:50] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-19 06:54:50] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:51] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2022-05-19 06:54:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-19 06:54:51] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:52] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2022-05-19 06:54:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2730 ms returned sat
[2022-05-19 06:54:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 111 ms.
[2022-05-19 06:54:55] [INFO ] Added : 7 causal constraints over 2 iterations in 370 ms. Result :sat
Minimization took 546 ms.
[2022-05-19 06:54:56] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:56] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:54:56] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-05-19 06:54:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:54:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:54:56] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:01] [INFO ] [Nat]Absence check using state equation in 4916 ms returned unknown
[2022-05-19 06:55:01] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:01] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:01] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-05-19 06:55:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:01] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-19 06:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:03] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2022-05-19 06:55:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 185 ms returned sat
[2022-05-19 06:55:03] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 1 ms to minimize.
[2022-05-19 06:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 558 ms
[2022-05-19 06:55:03] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 108 ms.
[2022-05-19 06:55:04] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 0 ms to minimize.
[2022-05-19 06:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2022-05-19 06:55:04] [INFO ] Added : 26 causal constraints over 6 iterations in 1158 ms. Result :sat
Minimization took 1918 ms.
[2022-05-19 06:55:06] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:06] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 15 ms returned sat
[2022-05-19 06:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:07] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-19 06:55:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:07] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-19 06:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:08] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2022-05-19 06:55:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2022-05-19 06:55:08] [INFO ] Deduced a trap composed of 218 places in 375 ms of which 0 ms to minimize.
[2022-05-19 06:55:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2022-05-19 06:55:09] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 114 ms.
[2022-05-19 06:55:09] [INFO ] Added : 16 causal constraints over 4 iterations in 519 ms. Result :sat
Minimization took 679 ms.
[2022-05-19 06:55:10] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2022-05-19 06:55:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-05-19 06:55:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:10] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:11] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2022-05-19 06:55:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 302 ms returned sat
[2022-05-19 06:55:11] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 153 ms.
[2022-05-19 06:55:15] [INFO ] Added : 10 causal constraints over 2 iterations in 3971 ms. Result :unknown
[2022-05-19 06:55:15] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-19 06:55:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 06:55:15] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-19 06:55:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 1, 1, 1, 10, 2, 10, 10, 3, 4, 1, 1] Max seen :[0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 255 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 413 transition count 1599
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 413 transition count 1599
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 2 with 4 rules applied. Total rules applied 116 place count 411 transition count 1597
Applied a total of 116 rules in 235 ms. Remains 411 /474 variables (removed 63) and now considering 1597/1650 (removed 53) transitions.
[2022-05-19 06:55:16] [INFO ] Flow matrix only has 1588 transitions (discarded 9 similar events)
// Phase 1: matrix 1588 rows 411 cols
[2022-05-19 06:55:16] [INFO ] Computed 62 place invariants in 53 ms
[2022-05-19 06:55:17] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 411/474 places, 982/1650 transitions.
Applied a total of 0 rules in 28 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/474 places, 982/1650 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:55:17] [INFO ] Computed 62 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 70218 resets, run finished after 12926 ms. (steps per millisecond=77 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9598 resets, run finished after 2476 ms. (steps per millisecond=403 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9588 resets, run finished after 2476 ms. (steps per millisecond=403 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9733 resets, run finished after 4818 ms. (steps per millisecond=207 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9754 resets, run finished after 2288 ms. (steps per millisecond=437 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8873 resets, run finished after 2158 ms. (steps per millisecond=463 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9613 resets, run finished after 2210 ms. (steps per millisecond=452 ) properties (out of 6) seen :16
[2022-05-19 06:55:46] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:55:46] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:55:46] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:55:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-19 06:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-19 06:55:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2022-05-19 06:55:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:47] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-19 06:55:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:48] [INFO ] [Nat]Absence check using state equation in 523 ms returned unsat
[2022-05-19 06:55:48] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:55:48] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:48] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-19 06:55:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:55:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:55:48] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:55:49] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-19 06:55:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2022-05-19 06:55:49] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 1 ms to minimize.
[2022-05-19 06:55:49] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:55:49] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 2 ms to minimize.
[2022-05-19 06:55:50] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 1 ms to minimize.
[2022-05-19 06:55:50] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:55:50] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:55:50] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2022-05-19 06:55:51] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:55:51] [INFO ] Deduced a trap composed of 168 places in 223 ms of which 1 ms to minimize.
[2022-05-19 06:55:51] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:55:52] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:55:52] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 0 ms to minimize.
[2022-05-19 06:55:52] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2022-05-19 06:55:52] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:55:53] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:55:53] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:55:53] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 0 ms to minimize.
[2022-05-19 06:55:53] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 1 ms to minimize.
[2022-05-19 06:55:54] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:55:54] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 0 ms to minimize.
[2022-05-19 06:55:54] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:55:55] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:55:55] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:55:55] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 0 ms to minimize.
[2022-05-19 06:55:55] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2022-05-19 06:55:56] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:55:56] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:55:56] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:55:57] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:55:57] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-19 06:55:57] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:55:58] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2022-05-19 06:55:58] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:55:58] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:55:58] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:55:59] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2022-05-19 06:55:59] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2022-05-19 06:55:59] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:56:00] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 0 ms to minimize.
[2022-05-19 06:56:00] [INFO ] Deduced a trap composed of 165 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:56:00] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:56:01] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 1 ms to minimize.
[2022-05-19 06:56:02] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:56:02] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2022-05-19 06:56:02] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 4 ms to minimize.
[2022-05-19 06:56:03] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 1 ms to minimize.
[2022-05-19 06:56:03] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2022-05-19 06:56:03] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:56:04] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:56:04] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:56:04] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:56:04] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:56:05] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:56:06] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:56:09] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 20158 ms
[2022-05-19 06:56:09] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:56:09] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:09] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-05-19 06:56:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:56:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:56:09] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:15] [INFO ] [Nat]Absence check using state equation in 6184 ms returned unknown
[2022-05-19 06:56:15] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-19 06:56:15] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:16] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-05-19 06:56:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:56:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:56:16] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:16] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-19 06:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2022-05-19 06:56:16] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2022-05-19 06:56:17] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:17] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:56:17] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:56:17] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:56:18] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:56:18] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 0 ms to minimize.
[2022-05-19 06:56:18] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:56:18] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:56:19] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:56:19] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2022-05-19 06:56:19] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:56:19] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:56:20] [INFO ] Deduced a trap composed of 152 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:56:20] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:56:20] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:20] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:56:21] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:56:21] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:56:21] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:56:21] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:56:22] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:56:22] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:56:22] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 0 ms to minimize.
[2022-05-19 06:56:23] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:56:23] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:56:24] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:56:25] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2022-05-19 06:56:28] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 11892 ms
Current structural bounds on expressions (after SMT) : [1, 1, 4, 10, 10, 4] Max seen :[1, 1, 4, 3, 4, 3]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:56:28] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 70415 resets, run finished after 9046 ms. (steps per millisecond=110 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9728 resets, run finished after 1651 ms. (steps per millisecond=605 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 8958 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 9605 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties (out of 3) seen :10
[2022-05-19 06:56:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:56:42] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:56:42] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:56:42] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:42] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-05-19 06:56:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:56:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-19 06:56:42] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:56:43] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-19 06:56:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:56:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2022-05-19 06:56:43] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:56:43] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2022-05-19 06:56:44] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:56:44] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:56:44] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:56:44] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:56:45] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:56:45] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:45] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2022-05-19 06:56:45] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2022-05-19 06:56:46] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2022-05-19 06:56:46] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:56:46] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:56:46] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2022-05-19 06:56:47] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:56:47] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:56:47] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:56:47] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 0 ms to minimize.
[2022-05-19 06:56:48] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:56:48] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2022-05-19 06:56:48] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:56:49] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:56:49] [INFO ] Deduced a trap composed of 164 places in 230 ms of which 1 ms to minimize.
[2022-05-19 06:56:49] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:56:49] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:56:50] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 1 ms to minimize.
[2022-05-19 06:56:50] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2022-05-19 06:56:50] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 1 ms to minimize.
[2022-05-19 06:56:51] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2022-05-19 06:56:51] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:51] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:56:52] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:56:52] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:56:52] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:56:53] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:56:53] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:56:53] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:53] [INFO ] Deduced a trap composed of 177 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:56:54] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:56:54] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:56:54] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:56:55] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:56:56] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:56:56] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:56:56] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:56:57] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:56:57] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2022-05-19 06:56:57] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2022-05-19 06:56:58] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2022-05-19 06:56:58] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2022-05-19 06:56:58] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:56:59] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2022-05-19 06:56:59] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2022-05-19 06:57:00] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 20031 ms
[2022-05-19 06:57:03] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:03] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:03] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2022-05-19 06:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:57:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:03] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:09] [INFO ] [Nat]Absence check using state equation in 6184 ms returned unknown
[2022-05-19 06:57:09] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:09] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:10] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-19 06:57:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:57:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:57:10] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:10] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-05-19 06:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2022-05-19 06:57:10] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2022-05-19 06:57:11] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:11] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:11] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:57:11] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:57:12] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:57:12] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:57:12] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:57:12] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:13] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:13] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:57:13] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:13] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:57:14] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:57:14] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:57:14] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:57:14] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:57:15] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:57:15] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:57:15] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:57:15] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2022-05-19 06:57:16] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2022-05-19 06:57:16] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:57:16] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 1 ms to minimize.
[2022-05-19 06:57:17] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:57:17] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2022-05-19 06:57:18] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:57:19] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:57:22] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 11720 ms
Current structural bounds on expressions (after SMT) : [10, 10, 4] Max seen :[3, 4, 3]
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:57:22] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:22] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:57:22] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-19 06:57:22] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:22] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:57:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:57:24] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2022-05-19 06:57:24] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-19 06:57:24] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:24] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:57:25] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-10
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:25] [INFO ] Computed 62 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 699 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2022-05-19 06:57:25] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:25] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-19 06:57:25] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:25] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:57:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:25] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-19 06:57:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:57:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:57:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:25] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-19 06:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:57:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2022-05-19 06:57:26] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2022-05-19 06:57:26] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2022-05-19 06:57:26] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-19 06:57:26] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 1 ms to minimize.
[2022-05-19 06:57:27] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:57:27] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:27] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-19 06:57:27] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:57:28] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:57:28] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:57:28] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:57:28] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:29] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:29] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:29] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:29] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2022-05-19 06:57:30] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:30] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:57:30] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:57:30] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:30] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-19 06:57:31] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:31] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 70459 resets, run finished after 8896 ms. (steps per millisecond=112 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9562 resets, run finished after 1706 ms. (steps per millisecond=586 ) properties (out of 1) seen :3
[2022-05-19 06:57:41] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:57:41] [INFO ] Computed 62 place invariants in 33 ms
[2022-05-19 06:57:41] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:57:41] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-19 06:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:42] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-05-19 06:57:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:57:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:57:42] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:57:42] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-19 06:57:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:57:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2022-05-19 06:57:42] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-19 06:57:42] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:43] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:57:43] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:57:43] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:43] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:57:44] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-19 06:57:44] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2022-05-19 06:57:44] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:57:44] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:57:45] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2022-05-19 06:57:45] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:57:45] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:57:46] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:57:46] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:57:46] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2022-05-19 06:57:46] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:57:46] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 1 ms to minimize.
[2022-05-19 06:57:47] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:57:47] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:57:47] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:48] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2022-05-19 06:57:48] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:57:48] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:57:48] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2022-05-19 06:57:49] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 0 ms to minimize.
[2022-05-19 06:57:49] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:57:49] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 0 ms to minimize.
[2022-05-19 06:57:50] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:50] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2022-05-19 06:57:50] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:57:50] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:57:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:51] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2022-05-19 06:57:51] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:52] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:52] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:57:52] [INFO ] Deduced a trap composed of 177 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:57:52] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 1 ms to minimize.
[2022-05-19 06:57:53] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:57:53] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 2 ms to minimize.
[2022-05-19 06:57:54] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:54] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:57:55] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2022-05-19 06:57:55] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2022-05-19 06:57:55] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-19 06:57:56] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:57:56] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 17 ms to minimize.
[2022-05-19 06:57:56] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 5 ms to minimize.
[2022-05-19 06:57:57] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:57:57] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2022-05-19 06:57:57] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:57:57] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:57:58] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:58:01] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 19363 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2022-05-19 06:58:01] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:01] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:58:02] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-05-19 06:58:02] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:02] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-19 06:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:58:03] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2022-05-19 06:58:04] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-19 06:58:04] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:04] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:58:04] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-10 in 39399 ms.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:04] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 673 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :4
[2022-05-19 06:58:04] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:04] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:58:04] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-19 06:58:04] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:04] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-19 06:58:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:58:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:58:04] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:09] [INFO ] [Nat]Absence check using state equation in 4934 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 981
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 35 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
[2022-05-19 06:58:09] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:09] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:58:10] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:10] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72803 resets, run finished after 9052 ms. (steps per millisecond=110 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 8961 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 1) seen :4
[2022-05-19 06:58:20] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:20] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:58:21] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-19 06:58:21] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:21] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-05-19 06:58:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:58:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-19 06:58:21] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:27] [INFO ] [Nat]Absence check using state equation in 6186 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 45 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 06:58:27] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:27] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-19 06:58:27] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-19 06:58:27] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:28] [INFO ] Computed 62 place invariants in 18 ms
[2022-05-19 06:58:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:58:29] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2022-05-19 06:58:29] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 06:58:29] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:29] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-19 06:58:30] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-11 in 25620 ms.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-13
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:30] [INFO ] Computed 62 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 711 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2022-05-19 06:58:30] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2022-05-19 06:58:30] [INFO ] Computed 62 place invariants in 20 ms
[2022-05-19 06:58:30] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:58:30] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2022-05-19 06:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:30] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-19 06:58:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:58:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:58:30] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-19 06:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:30] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-19 06:58:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:58:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 165 ms returned sat
[2022-05-19 06:58:31] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2022-05-19 06:58:31] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2022-05-19 06:58:31] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2022-05-19 06:58:31] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:58:32] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:58:32] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2022-05-19 06:58:32] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:58:32] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:33] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:58:33] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:58:33] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:33] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:58:34] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:58:34] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 0 ms to minimize.
[2022-05-19 06:58:34] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:35] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2022-05-19 06:58:35] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:35] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:58:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 411/411 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 981
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 981
Applied a total of 2 rules in 29 ms. Remains 410 /411 variables (removed 1) and now considering 981/982 (removed 1) transitions.
[2022-05-19 06:58:35] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:35] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-19 06:58:35] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/411 places, 981/982 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:35] [INFO ] Computed 62 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 72607 resets, run finished after 9006 ms. (steps per millisecond=111 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9709 resets, run finished after 1681 ms. (steps per millisecond=594 ) properties (out of 1) seen :3
[2022-05-19 06:58:46] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:58:46] [INFO ] Computed 62 place invariants in 16 ms
[2022-05-19 06:58:46] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:58:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:46] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-19 06:58:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 06:58:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-19 06:58:47] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-19 06:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 06:58:47] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-19 06:58:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:58:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 173 ms returned sat
[2022-05-19 06:58:47] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2022-05-19 06:58:47] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2022-05-19 06:58:48] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:48] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:58:48] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:58:48] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:58:49] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:58:49] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:58:49] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:58:49] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2022-05-19 06:58:50] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:58:50] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:58:50] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:58:51] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:58:51] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2022-05-19 06:58:51] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 1 ms to minimize.
[2022-05-19 06:58:51] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 1 ms to minimize.
[2022-05-19 06:58:52] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 1 ms to minimize.
[2022-05-19 06:58:52] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 0 ms to minimize.
[2022-05-19 06:58:52] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:58:52] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2022-05-19 06:58:53] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2022-05-19 06:58:53] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 1 ms to minimize.
[2022-05-19 06:58:53] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2022-05-19 06:58:54] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 0 ms to minimize.
[2022-05-19 06:58:54] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2022-05-19 06:58:54] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:58:54] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:58:55] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:58:55] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:58:55] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:58:55] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 1 ms to minimize.
[2022-05-19 06:58:56] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2022-05-19 06:58:56] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2022-05-19 06:58:56] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2022-05-19 06:58:57] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:58:57] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2022-05-19 06:58:57] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:58:58] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 1 ms to minimize.
[2022-05-19 06:58:58] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:58:58] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:58:58] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:58:59] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2022-05-19 06:58:59] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2022-05-19 06:58:59] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:58:59] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:59:00] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2022-05-19 06:59:01] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:59:03] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2022-05-19 06:59:04] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-19 06:59:04] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2022-05-19 06:59:05] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2022-05-19 06:59:05] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 1 ms to minimize.
[2022-05-19 06:59:05] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:59:05] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:59:06] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2022-05-19 06:59:06] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:59:07] [INFO ] Deduced a trap composed of 168 places in 225 ms of which 0 ms to minimize.
[2022-05-19 06:59:08] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 1 ms to minimize.
[2022-05-19 06:59:08] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2022-05-19 06:59:09] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2022-05-19 06:59:09] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2022-05-19 06:59:09] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 0 ms to minimize.
[2022-05-19 06:59:10] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 1 ms to minimize.
[2022-05-19 06:59:10] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2022-05-19 06:59:11] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2022-05-19 06:59:11] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2022-05-19 06:59:11] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 0 ms to minimize.
[2022-05-19 06:59:12] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2022-05-19 06:59:12] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2022-05-19 06:59:12] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2022-05-19 06:59:12] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2022-05-19 06:59:13] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2022-05-19 06:59:13] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 0 ms to minimize.
[2022-05-19 06:59:14] [INFO ] Deduced a trap composed of 162 places in 288 ms of which 1 ms to minimize.
[2022-05-19 06:59:15] [INFO ] Deduced a trap composed of 156 places in 229 ms of which 0 ms to minimize.
[2022-05-19 06:59:18] [INFO ] Trap strengthening (SAT) tested/added 76/76 trap constraints in 31319 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-19 06:59:18] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:59:18] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-19 06:59:19] [INFO ] Implicit Places using invariants in 320 ms returned []
[2022-05-19 06:59:19] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:59:19] [INFO ] Computed 62 place invariants in 9 ms
[2022-05-19 06:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 06:59:20] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2022-05-19 06:59:20] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 06:59:20] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-19 06:59:20] [INFO ] Computed 62 place invariants in 14 ms
[2022-05-19 06:59:21] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-13 in 51113 ms.
[2022-05-19 06:59:21] [INFO ] Flatten gal took : 170 ms
[2022-05-19 06:59:21] [INFO ] Applying decomposition
[2022-05-19 06:59:21] [INFO ] Flatten gal took : 124 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8952507813881272616.txt' '-o' '/tmp/graph8952507813881272616.bin' '-w' '/tmp/graph8952507813881272616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8952507813881272616.bin' '-l' '-1' '-v' '-w' '/tmp/graph8952507813881272616.weights' '-q' '0' '-e' '0.001'
[2022-05-19 06:59:21] [INFO ] Decomposing Gal with order
[2022-05-19 06:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 06:59:22] [INFO ] Removed a total of 2737 redundant transitions.
[2022-05-19 06:59:22] [INFO ] Flatten gal took : 211 ms
[2022-05-19 06:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 259 labels/synchronizations in 44 ms.
[2022-05-19 06:59:22] [INFO ] Time to serialize gal into /tmp/UpperBounds9581224376352264644.gal : 15 ms
[2022-05-19 06:59:22] [INFO ] Time to serialize properties into /tmp/UpperBounds8986354463155860871.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9581224376352264644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8986354463155860871.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds8986354463155860871.prop.
Detected timeout of ITS tools.
[2022-05-19 07:21:08] [INFO ] Applying decomposition
[2022-05-19 07:21:08] [INFO ] Flatten gal took : 474 ms
[2022-05-19 07:21:08] [INFO ] Decomposing Gal with order
[2022-05-19 07:21:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:21:09] [INFO ] Removed a total of 5759 redundant transitions.
[2022-05-19 07:21:09] [INFO ] Flatten gal took : 548 ms
[2022-05-19 07:21:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 453 ms.
[2022-05-19 07:21:10] [INFO ] Time to serialize gal into /tmp/UpperBounds12133727495032646675.gal : 50 ms
[2022-05-19 07:21:10] [INFO ] Time to serialize properties into /tmp/UpperBounds5960384162308752644.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12133727495032646675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5960384162308752644.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds5960384162308752644.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.01779e+10,914.361,11759332,5.2833e+06,32,2.65299e+07,4933,1823,1.75827e+07,48,4651,0
Total reachable state count : 30177920505
Verifying 3 reachability properties.
Detected timeout of ITS tools.
[2022-05-19 07:42:55] [INFO ] Flatten gal took : 623 ms
[2022-05-19 07:42:56] [INFO ] Input system was already deterministic with 982 transitions.
[2022-05-19 07:42:56] [INFO ] Transformed 411 places.
[2022-05-19 07:42:56] [INFO ] Transformed 982 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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
[2022-05-19 07:43:26] [INFO ] Time to serialize gal into /tmp/UpperBounds15930274891003309589.gal : 17 ms
[2022-05-19 07:43:26] [INFO ] Time to serialize properties into /tmp/UpperBounds13258021639468223645.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15930274891003309589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13258021639468223645.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13258021639468223645.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="UpperBounds"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017200773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;