About the Execution of ITS-Tools for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.151 | 3600000.00 | 2220243.00 | 751492.30 | ? 1 1 1 ? 2 1 1 1 2 1 1 4 1 1 4 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800701.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800701
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678944802888
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 05:33:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 05:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:33:24] [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.
[2023-03-16 05:33:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 05:33:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1156 ms
[2023-03-16 05:33:25] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-16 05:33:25] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-16 05:33:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 05:33:25] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-16 05:33:25] [INFO ] Invariant cache hit.
[2023-03-16 05:33:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 05:33:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-16 05:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-16 05:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-16 05:33:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:33:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
[2023-03-16 05:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-16 05:33:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 05:33:26] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 65 ms.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 05:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-16 05:33:26] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2023-03-16 05:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-16 05:33:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 05:33:26] [INFO ] Added : 36 causal constraints over 8 iterations in 58 ms. Result :sat
Minimization took 12 ms.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-16 05:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-03-16 05:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-16 05:33:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 05:33:26] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 05:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-16 05:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 05:33:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 05:33:26] [INFO ] Added : 15 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-16 05:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 05:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-16 05:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-16 05:33:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 05:33:27] [INFO ] Added : 14 causal constraints over 4 iterations in 256 ms. Result :sat
Minimization took 83 ms.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-16 05:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-16 05:33:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 05:33:27] [INFO ] Added : 20 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-16 05:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-16 05:33:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 05:33:27] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2023-03-16 05:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 05:33:27] [INFO ] Added : 33 causal constraints over 7 iterations in 144 ms. Result :sat
Minimization took 24 ms.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 05:33:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 05:33:27] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2023-03-16 05:33:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 05:33:28] [INFO ] Added : 36 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 05:33:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 05:33:28] [INFO ] Added : 20 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-16 05:33:28] [INFO ] Added : 36 causal constraints over 8 iterations in 144 ms. Result :sat
Minimization took 14 ms.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 05:33:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 05:33:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-16 05:33:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-16 05:33:29] [INFO ] Added : 36 causal constraints over 8 iterations in 191 ms. Result :sat
Minimization took 15 ms.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-16 05:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-16 05:33:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 05:33:29] [INFO ] Added : 20 causal constraints over 4 iterations in 221 ms. Result :sat
Minimization took 72 ms.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 05:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 05:33:29] [INFO ] Added : 36 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 05:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 05:33:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 05:33:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-16 05:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-16 05:33:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 05:33:30] [INFO ] Added : 19 causal constraints over 4 iterations in 263 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, 1, 10, 2, 1, -1, -1, 2, 1, 1, 4, -1, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
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.
[2023-03-16 05:33:30] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 196 ms.
[2023-03-16 05:33:30] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 15) seen :3
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) 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 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :14
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :1
[2023-03-16 05:33:31] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-16 05:33:31] [INFO ] Computed 152 place invariants in 216 ms
[2023-03-16 05:33:31] [INFO ] [Real]Absence check using 145 positive place invariants in 50 ms returned sat
[2023-03-16 05:33:31] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:32] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2023-03-16 05:33:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:32] [INFO ] [Nat]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-16 05:33:32] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 05:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:34] [INFO ] [Nat]Absence check using state equation in 1937 ms returned sat
[2023-03-16 05:33:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:33:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 364 ms returned sat
[2023-03-16 05:33:35] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 337 ms.
[2023-03-16 05:33:36] [INFO ] Deduced a trap composed of 327 places in 717 ms of which 2 ms to minimize.
[2023-03-16 05:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1109 ms
[2023-03-16 05:33:37] [INFO ] Added : 13 causal constraints over 4 iterations in 2184 ms. Result :sat
Minimization took 222 ms.
[2023-03-16 05:33:37] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-16 05:33:37] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:38] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2023-03-16 05:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:38] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-16 05:33:38] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-16 05:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:40] [INFO ] [Nat]Absence check using state equation in 1745 ms returned sat
[2023-03-16 05:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1279 ms returned sat
[2023-03-16 05:33:42] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 602 ms.
[2023-03-16 05:33:43] [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 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-16 05:33:43] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-16 05:33:43] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:44] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2023-03-16 05:33:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:44] [INFO ] [Nat]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-16 05:33:44] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 05:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:46] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2023-03-16 05:33:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2023-03-16 05:33:46] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 218 ms.
[2023-03-16 05:33:47] [INFO ] Added : 6 causal constraints over 2 iterations in 608 ms. Result :sat
Minimization took 522 ms.
[2023-03-16 05:33:47] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-16 05:33:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:48] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2023-03-16 05:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:49] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-16 05:33:49] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-16 05:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:51] [INFO ] [Nat]Absence check using state equation in 2332 ms returned sat
[2023-03-16 05:33:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 72 ms returned sat
[2023-03-16 05:33:51] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 239 ms.
[2023-03-16 05:33:52] [INFO ] Added : 7 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 797 ms.
[2023-03-16 05:33:53] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-16 05:33:53] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:54] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2023-03-16 05:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:33:54] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-16 05:33:54] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-16 05:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:33:56] [INFO ] [Nat]Absence check using state equation in 2030 ms returned sat
[2023-03-16 05:33:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 576 ms returned sat
[2023-03-16 05:33:57] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 219 ms.
[2023-03-16 05:33:58] [INFO ] Deduced a trap composed of 328 places in 744 ms of which 1 ms to minimize.
[2023-03-16 05:33:59] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1422 ms
[2023-03-16 05:34:00] [INFO ] Deduced a trap composed of 11 places in 883 ms of which 2 ms to minimize.
[2023-03-16 05:34:00] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-16 05:34:00] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-16 05:34:00] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-16 05:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:01] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2023-03-16 05:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:34:01] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-16 05:34:01] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-16 05:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:06] [INFO ] [Nat]Absence check using state equation in 4845 ms returned unknown
[2023-03-16 05:34:06] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-16 05:34:06] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned unsat
[2023-03-16 05:34:06] [INFO ] [Real]Absence check using 145 positive place invariants in 39 ms returned sat
[2023-03-16 05:34:06] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2023-03-16 05:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:07] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2023-03-16 05:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:34:07] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-16 05:34:07] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:09] [INFO ] [Nat]Absence check using state equation in 1482 ms returned sat
[2023-03-16 05:34:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 267 ms returned sat
[2023-03-16 05:34:09] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 197 ms.
[2023-03-16 05:34:11] [INFO ] Deduced a trap composed of 19 places in 764 ms of which 3 ms to minimize.
[2023-03-16 05:34:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 974 ms
[2023-03-16 05:34:11] [INFO ] Added : 23 causal constraints over 5 iterations in 2035 ms. Result :sat
Minimization took 940 ms.
[2023-03-16 05:34:12] [INFO ] [Real]Absence check using 145 positive place invariants in 41 ms returned sat
[2023-03-16 05:34:12] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:13] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2023-03-16 05:34:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:34:13] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-16 05:34:13] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-16 05:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:16] [INFO ] [Nat]Absence check using state equation in 3026 ms returned sat
[2023-03-16 05:34:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 72 ms returned sat
[2023-03-16 05:34:17] [INFO ] Deduced a trap composed of 506 places in 706 ms of which 1 ms to minimize.
[2023-03-16 05:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1042 ms
[2023-03-16 05:34:18] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 232 ms.
[2023-03-16 05:34:18] [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 8
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-16 05:34:18] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-16 05:34:18] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-16 05:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:19] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2023-03-16 05:34:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:34:19] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2023-03-16 05:34:19] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-16 05:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:20] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2023-03-16 05:34:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 512 ms returned sat
[2023-03-16 05:34:21] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 206 ms.
[2023-03-16 05:34:23] [INFO ] Deduced a trap composed of 19 places in 371 ms of which 1 ms to minimize.
[2023-03-16 05:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 602 ms
[2023-03-16 05:34:23] [INFO ] Added : 27 causal constraints over 6 iterations in 1964 ms. Result :sat
Minimization took 1166 ms.
[2023-03-16 05:34:24] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-16 05:34:24] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 2147483647, 1, 1, 10, 2, 1, 2147483647, 2, 2147483647, 4] Max seen :[2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 4]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 1224 transition count 2747
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 138 place count 1161 transition count 2745
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 140 place count 1159 transition count 2681
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 268 place count 1095 transition count 2681
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 1094 transition count 2680
Applied a total of 270 rules in 494 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
[2023-03-16 05:34:25] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2023-03-16 05:34:25] [INFO ] Computed 142 place invariants in 92 ms
[2023-03-16 05:34:26] [INFO ] Dead Transitions using invariants and state equation in 1422 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 REACHABILITY mode, iteration 1 : 1094/1234 places, 2065/2810 transitions.
Applied a total of 0 rules in 60 ms. Remains 1094 /1094 variables (removed 0) and now considering 2065/2065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1978 ms. Remains : 1094/1234 places, 2065/2810 transitions.
Normalized transition count is 2056 out of 2065 initially.
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-16 05:34:27] [INFO ] Computed 142 place invariants in 62 ms
Incomplete random walk after 1000000 steps, including 68901 resets, run finished after 10047 ms. (steps per millisecond=99 ) properties (out of 7) seen :13
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7075 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7390 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7286 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7278 resets, run finished after 1985 ms. (steps per millisecond=503 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7107 resets, run finished after 1934 ms. (steps per millisecond=517 ) properties (out of 5) seen :9
[2023-03-16 05:34:46] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-16 05:34:46] [INFO ] Computed 142 place invariants in 77 ms
[2023-03-16 05:34:47] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 05:34:47] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 05:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:47] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-16 05:34:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:34:47] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:34:47] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 05:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:34:48] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2023-03-16 05:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:34:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 553 ms returned sat
[2023-03-16 05:34:49] [INFO ] Deduced a trap composed of 447 places in 481 ms of which 1 ms to minimize.
[2023-03-16 05:34:49] [INFO ] Deduced a trap composed of 447 places in 471 ms of which 1 ms to minimize.
[2023-03-16 05:34:50] [INFO ] Deduced a trap composed of 445 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:34:50] [INFO ] Deduced a trap composed of 445 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:34:51] [INFO ] Deduced a trap composed of 447 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:34:52] [INFO ] Deduced a trap composed of 443 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:34:52] [INFO ] Deduced a trap composed of 437 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:34:53] [INFO ] Deduced a trap composed of 445 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:34:53] [INFO ] Deduced a trap composed of 449 places in 475 ms of which 0 ms to minimize.
[2023-03-16 05:34:54] [INFO ] Deduced a trap composed of 445 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:34:55] [INFO ] Deduced a trap composed of 445 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:34:55] [INFO ] Deduced a trap composed of 445 places in 468 ms of which 1 ms to minimize.
[2023-03-16 05:34:56] [INFO ] Deduced a trap composed of 441 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:34:56] [INFO ] Deduced a trap composed of 449 places in 457 ms of which 0 ms to minimize.
[2023-03-16 05:34:57] [INFO ] Deduced a trap composed of 451 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:34:57] [INFO ] Deduced a trap composed of 439 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:34:58] [INFO ] Deduced a trap composed of 441 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:34:59] [INFO ] Deduced a trap composed of 447 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:34:59] [INFO ] Deduced a trap composed of 443 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:35:00] [INFO ] Deduced a trap composed of 445 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:35:00] [INFO ] Deduced a trap composed of 451 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:35:01] [INFO ] Deduced a trap composed of 433 places in 455 ms of which 0 ms to minimize.
[2023-03-16 05:35:01] [INFO ] Deduced a trap composed of 425 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:35:02] [INFO ] Deduced a trap composed of 437 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:35:02] [INFO ] Deduced a trap composed of 445 places in 480 ms of which 1 ms to minimize.
[2023-03-16 05:35:03] [INFO ] Deduced a trap composed of 437 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:35:04] [INFO ] Deduced a trap composed of 443 places in 466 ms of which 2 ms to minimize.
[2023-03-16 05:35:04] [INFO ] Deduced a trap composed of 439 places in 461 ms of which 0 ms to minimize.
[2023-03-16 05:35:05] [INFO ] Deduced a trap composed of 439 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:35:06] [INFO ] Deduced a trap composed of 447 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:35:07] [INFO ] Deduced a trap composed of 445 places in 478 ms of which 1 ms to minimize.
[2023-03-16 05:35:07] [INFO ] Deduced a trap composed of 441 places in 489 ms of which 1 ms to minimize.
[2023-03-16 05:35:08] [INFO ] Deduced a trap composed of 445 places in 468 ms of which 4 ms to minimize.
[2023-03-16 05:35:08] [INFO ] Deduced a trap composed of 451 places in 470 ms of which 2 ms to minimize.
[2023-03-16 05:35:09] [INFO ] Deduced a trap composed of 453 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:35:10] [INFO ] Deduced a trap composed of 431 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:35:11] [INFO ] Deduced a trap composed of 443 places in 478 ms of which 1 ms to minimize.
[2023-03-16 05:35:11] [INFO ] Deduced a trap composed of 447 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:35:12] [INFO ] Deduced a trap composed of 447 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:35:12] [INFO ] Deduced a trap composed of 451 places in 490 ms of which 1 ms to minimize.
[2023-03-16 05:35:13] [INFO ] Deduced a trap composed of 441 places in 470 ms of which 1 ms to minimize.
[2023-03-16 05:35:14] [INFO ] Deduced a trap composed of 445 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:35:14] [INFO ] Deduced a trap composed of 441 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:35:15] [INFO ] Deduced a trap composed of 445 places in 456 ms of which 3 ms to minimize.
[2023-03-16 05:35:16] [INFO ] Deduced a trap composed of 439 places in 473 ms of which 3 ms to minimize.
[2023-03-16 05:35:17] [INFO ] Deduced a trap composed of 449 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:35:17] [INFO ] Deduced a trap composed of 445 places in 468 ms of which 1 ms to minimize.
[2023-03-16 05:35:18] [INFO ] Deduced a trap composed of 449 places in 464 ms of which 1 ms to minimize.
[2023-03-16 05:35:19] [INFO ] Deduced a trap composed of 451 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:35:19] [INFO ] Deduced a trap composed of 447 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:35:20] [INFO ] Deduced a trap composed of 439 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:35:20] [INFO ] Deduced a trap composed of 447 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:35:21] [INFO ] Deduced a trap composed of 447 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:35:22] [INFO ] Deduced a trap composed of 449 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:35:22] [INFO ] Deduced a trap composed of 451 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:35:23] [INFO ] Deduced a trap composed of 453 places in 447 ms of which 1 ms to minimize.
[2023-03-16 05:35:23] [INFO ] Deduced a trap composed of 447 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:35:24] [INFO ] Deduced a trap composed of 447 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:35:25] [INFO ] Deduced a trap composed of 443 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:35:27] [INFO ] Deduced a trap composed of 433 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:35:28] [INFO ] Deduced a trap composed of 447 places in 443 ms of which 1 ms to minimize.
[2023-03-16 05:35:28] [INFO ] Deduced a trap composed of 455 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:35:29] [INFO ] Deduced a trap composed of 433 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:35:29] [INFO ] Deduced a trap composed of 443 places in 433 ms of which 1 ms to minimize.
[2023-03-16 05:35:31] [INFO ] Deduced a trap composed of 441 places in 435 ms of which 1 ms to minimize.
[2023-03-16 05:35:31] [INFO ] Deduced a trap composed of 443 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:35:32] [INFO ] Deduced a trap composed of 447 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:35:32] [INFO ] Trap strengthening (SAT) tested/added 67/67 trap constraints in 43812 ms
[2023-03-16 05:35:32] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:35:32] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-16 05:35:32] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-16 05:35:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 05:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:35:33] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-16 05:35:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:35:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-16 05:35:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 05:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:35:34] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-16 05:35:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 578 ms returned sat
[2023-03-16 05:35:35] [INFO ] Deduced a trap composed of 431 places in 476 ms of which 0 ms to minimize.
[2023-03-16 05:35:35] [INFO ] Deduced a trap composed of 435 places in 476 ms of which 1 ms to minimize.
[2023-03-16 05:35:36] [INFO ] Deduced a trap composed of 445 places in 464 ms of which 0 ms to minimize.
[2023-03-16 05:35:37] [INFO ] Deduced a trap composed of 439 places in 460 ms of which 0 ms to minimize.
[2023-03-16 05:35:37] [INFO ] Deduced a trap composed of 443 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:35:38] [INFO ] Deduced a trap composed of 445 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:35:38] [INFO ] Deduced a trap composed of 443 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:35:39] [INFO ] Deduced a trap composed of 447 places in 427 ms of which 1 ms to minimize.
[2023-03-16 05:35:39] [INFO ] Deduced a trap composed of 441 places in 486 ms of which 1 ms to minimize.
[2023-03-16 05:35:40] [INFO ] Deduced a trap composed of 455 places in 438 ms of which 1 ms to minimize.
[2023-03-16 05:35:41] [INFO ] Deduced a trap composed of 435 places in 440 ms of which 1 ms to minimize.
[2023-03-16 05:35:41] [INFO ] Deduced a trap composed of 443 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:35:42] [INFO ] Deduced a trap composed of 447 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:35:42] [INFO ] Deduced a trap composed of 445 places in 447 ms of which 1 ms to minimize.
[2023-03-16 05:35:43] [INFO ] Deduced a trap composed of 461 places in 434 ms of which 1 ms to minimize.
[2023-03-16 05:35:43] [INFO ] Deduced a trap composed of 443 places in 427 ms of which 1 ms to minimize.
[2023-03-16 05:35:44] [INFO ] Deduced a trap composed of 441 places in 428 ms of which 1 ms to minimize.
[2023-03-16 05:35:44] [INFO ] Deduced a trap composed of 445 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:35:45] [INFO ] Deduced a trap composed of 455 places in 422 ms of which 1 ms to minimize.
[2023-03-16 05:35:45] [INFO ] Deduced a trap composed of 447 places in 428 ms of which 1 ms to minimize.
[2023-03-16 05:35:46] [INFO ] Deduced a trap composed of 445 places in 442 ms of which 0 ms to minimize.
[2023-03-16 05:35:47] [INFO ] Deduced a trap composed of 445 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:35:47] [INFO ] Deduced a trap composed of 444 places in 464 ms of which 1 ms to minimize.
[2023-03-16 05:35:49] [INFO ] Deduced a trap composed of 445 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:35:50] [INFO ] Deduced a trap composed of 453 places in 463 ms of which 0 ms to minimize.
[2023-03-16 05:35:50] [INFO ] Deduced a trap composed of 457 places in 458 ms of which 0 ms to minimize.
[2023-03-16 05:35:51] [INFO ] Deduced a trap composed of 447 places in 437 ms of which 0 ms to minimize.
[2023-03-16 05:35:52] [INFO ] Deduced a trap composed of 443 places in 443 ms of which 1 ms to minimize.
[2023-03-16 05:35:53] [INFO ] Deduced a trap composed of 439 places in 477 ms of which 1 ms to minimize.
[2023-03-16 05:35:53] [INFO ] Deduced a trap composed of 441 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:35:54] [INFO ] Deduced a trap composed of 449 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:35:54] [INFO ] Deduced a trap composed of 443 places in 468 ms of which 2 ms to minimize.
[2023-03-16 05:35:55] [INFO ] Deduced a trap composed of 443 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:35:55] [INFO ] Deduced a trap composed of 439 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:35:56] [INFO ] Deduced a trap composed of 453 places in 441 ms of which 1 ms to minimize.
[2023-03-16 05:35:56] [INFO ] Deduced a trap composed of 433 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:35:57] [INFO ] Deduced a trap composed of 449 places in 437 ms of which 1 ms to minimize.
[2023-03-16 05:35:58] [INFO ] Deduced a trap composed of 435 places in 445 ms of which 0 ms to minimize.
[2023-03-16 05:35:58] [INFO ] Deduced a trap composed of 445 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:35:59] [INFO ] Deduced a trap composed of 447 places in 471 ms of which 1 ms to minimize.
[2023-03-16 05:35:59] [INFO ] Deduced a trap composed of 453 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:36:00] [INFO ] Deduced a trap composed of 453 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:36:00] [INFO ] Deduced a trap composed of 455 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:36:01] [INFO ] Deduced a trap composed of 439 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:36:02] [INFO ] Deduced a trap composed of 443 places in 447 ms of which 1 ms to minimize.
[2023-03-16 05:36:03] [INFO ] Deduced a trap composed of 453 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:36:03] [INFO ] Deduced a trap composed of 447 places in 468 ms of which 1 ms to minimize.
[2023-03-16 05:36:04] [INFO ] Deduced a trap composed of 449 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:36:04] [INFO ] Deduced a trap composed of 445 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:36:05] [INFO ] Deduced a trap composed of 449 places in 448 ms of which 2 ms to minimize.
[2023-03-16 05:36:06] [INFO ] Deduced a trap composed of 451 places in 440 ms of which 1 ms to minimize.
[2023-03-16 05:36:06] [INFO ] Deduced a trap composed of 451 places in 420 ms of which 1 ms to minimize.
[2023-03-16 05:36:07] [INFO ] Deduced a trap composed of 455 places in 422 ms of which 1 ms to minimize.
[2023-03-16 05:36:08] [INFO ] Deduced a trap composed of 443 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:36:08] [INFO ] Deduced a trap composed of 449 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:36:09] [INFO ] Deduced a trap composed of 445 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:36:10] [INFO ] Deduced a trap composed of 445 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:36:10] [INFO ] Deduced a trap composed of 453 places in 483 ms of which 0 ms to minimize.
[2023-03-16 05:36:11] [INFO ] Deduced a trap composed of 443 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:36:11] [INFO ] Deduced a trap composed of 445 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:36:13] [INFO ] Deduced a trap composed of 447 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:36:13] [INFO ] Deduced a trap composed of 449 places in 479 ms of which 1 ms to minimize.
[2023-03-16 05:36:14] [INFO ] Deduced a trap composed of 443 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:36:15] [INFO ] Deduced a trap composed of 429 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:36:16] [INFO ] Deduced a trap composed of 447 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:36:16] [INFO ] Deduced a trap composed of 453 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:36:18] [INFO ] Deduced a trap composed of 463 places in 480 ms of which 1 ms to minimize.
[2023-03-16 05:36:18] [INFO ] Trap strengthening (SAT) tested/added 67/67 trap constraints in 43748 ms
[2023-03-16 05:36:18] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-16 05:36:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-16 05:36:18] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-16 05:36:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 10, 1, 1] Max seen :[3, 1, 3, 1, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2065/2065 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1094 transition count 2064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1093 transition count 2064
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 6 place count 1091 transition count 2062
Applied a total of 6 rules in 173 ms. Remains 1091 /1094 variables (removed 3) and now considering 2062/2065 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1091/1094 places, 2062/2065 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:36:19] [INFO ] Computed 142 place invariants in 66 ms
Incomplete random walk after 1000000 steps, including 70275 resets, run finished after 9982 ms. (steps per millisecond=100 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 7213 resets, run finished after 1909 ms. (steps per millisecond=523 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7404 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties (out of 2) seen :4
[2023-03-16 05:36:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:36:33] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-16 05:36:33] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 05:36:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 05:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:36:33] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-16 05:36:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:36:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 05:36:34] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-16 05:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:36:34] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-16 05:36:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:36:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 953 ms returned sat
[2023-03-16 05:36:35] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 0 ms to minimize.
[2023-03-16 05:36:36] [INFO ] Deduced a trap composed of 450 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:36:37] [INFO ] Deduced a trap composed of 438 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:36:37] [INFO ] Deduced a trap composed of 442 places in 473 ms of which 1 ms to minimize.
[2023-03-16 05:36:38] [INFO ] Deduced a trap composed of 454 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:36:38] [INFO ] Deduced a trap composed of 452 places in 437 ms of which 1 ms to minimize.
[2023-03-16 05:36:39] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:36:39] [INFO ] Deduced a trap composed of 442 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:36:40] [INFO ] Deduced a trap composed of 444 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:36:40] [INFO ] Deduced a trap composed of 454 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:36:41] [INFO ] Deduced a trap composed of 438 places in 434 ms of which 1 ms to minimize.
[2023-03-16 05:36:41] [INFO ] Deduced a trap composed of 438 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:36:42] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:36:42] [INFO ] Deduced a trap composed of 452 places in 442 ms of which 1 ms to minimize.
[2023-03-16 05:36:43] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:36:44] [INFO ] Deduced a trap composed of 436 places in 455 ms of which 0 ms to minimize.
[2023-03-16 05:36:44] [INFO ] Deduced a trap composed of 446 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:36:45] [INFO ] Deduced a trap composed of 454 places in 492 ms of which 1 ms to minimize.
[2023-03-16 05:36:45] [INFO ] Deduced a trap composed of 452 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:36:46] [INFO ] Deduced a trap composed of 434 places in 440 ms of which 1 ms to minimize.
[2023-03-16 05:36:46] [INFO ] Deduced a trap composed of 448 places in 434 ms of which 0 ms to minimize.
[2023-03-16 05:36:47] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2023-03-16 05:36:48] [INFO ] Deduced a trap composed of 432 places in 468 ms of which 1 ms to minimize.
[2023-03-16 05:36:49] [INFO ] Deduced a trap composed of 456 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:36:49] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2023-03-16 05:36:50] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-16 05:36:51] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:36:51] [INFO ] Deduced a trap composed of 436 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:36:52] [INFO ] Deduced a trap composed of 444 places in 429 ms of which 1 ms to minimize.
[2023-03-16 05:36:53] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2023-03-16 05:36:53] [INFO ] Deduced a trap composed of 446 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:36:54] [INFO ] Deduced a trap composed of 436 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:36:55] [INFO ] Deduced a trap composed of 436 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:36:56] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-16 05:36:56] [INFO ] Deduced a trap composed of 432 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:36:57] [INFO ] Deduced a trap composed of 456 places in 458 ms of which 0 ms to minimize.
[2023-03-16 05:36:57] [INFO ] Deduced a trap composed of 450 places in 484 ms of which 1 ms to minimize.
[2023-03-16 05:36:58] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 0 ms to minimize.
[2023-03-16 05:36:58] [INFO ] Deduced a trap composed of 442 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:36:59] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 0 ms to minimize.
[2023-03-16 05:36:59] [INFO ] Deduced a trap composed of 444 places in 438 ms of which 1 ms to minimize.
[2023-03-16 05:37:00] [INFO ] Deduced a trap composed of 430 places in 435 ms of which 1 ms to minimize.
[2023-03-16 05:37:00] [INFO ] Deduced a trap composed of 440 places in 442 ms of which 1 ms to minimize.
[2023-03-16 05:37:01] [INFO ] Deduced a trap composed of 438 places in 474 ms of which 0 ms to minimize.
[2023-03-16 05:37:02] [INFO ] Deduced a trap composed of 440 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:37:02] [INFO ] Deduced a trap composed of 434 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:37:03] [INFO ] Deduced a trap composed of 440 places in 473 ms of which 1 ms to minimize.
[2023-03-16 05:37:04] [INFO ] Deduced a trap composed of 444 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:37:05] [INFO ] Deduced a trap composed of 440 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:37:05] [INFO ] Deduced a trap composed of 440 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:37:06] [INFO ] Deduced a trap composed of 440 places in 464 ms of which 1 ms to minimize.
[2023-03-16 05:37:08] [INFO ] Deduced a trap composed of 432 places in 421 ms of which 1 ms to minimize.
[2023-03-16 05:37:09] [INFO ] Deduced a trap composed of 442 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:37:10] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2023-03-16 05:37:10] [INFO ] Deduced a trap composed of 444 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:37:11] [INFO ] Deduced a trap composed of 448 places in 467 ms of which 0 ms to minimize.
[2023-03-16 05:37:11] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 1 ms to minimize.
[2023-03-16 05:37:14] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 39151 ms
[2023-03-16 05:37:14] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-16 05:37:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-16 05:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:37:15] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-03-16 05:37:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:37:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-16 05:37:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:37:15] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-16 05:37:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 650 ms returned sat
[2023-03-16 05:37:17] [INFO ] Deduced a trap composed of 442 places in 430 ms of which 1 ms to minimize.
[2023-03-16 05:37:17] [INFO ] Deduced a trap composed of 434 places in 422 ms of which 1 ms to minimize.
[2023-03-16 05:37:18] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-16 05:37:18] [INFO ] Deduced a trap composed of 434 places in 433 ms of which 1 ms to minimize.
[2023-03-16 05:37:19] [INFO ] Deduced a trap composed of 438 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:37:19] [INFO ] Deduced a trap composed of 436 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:37:20] [INFO ] Deduced a trap composed of 444 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:37:20] [INFO ] Deduced a trap composed of 436 places in 446 ms of which 0 ms to minimize.
[2023-03-16 05:37:21] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 0 ms to minimize.
[2023-03-16 05:37:21] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:37:22] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 0 ms to minimize.
[2023-03-16 05:37:23] [INFO ] Deduced a trap composed of 438 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:37:23] [INFO ] Deduced a trap composed of 448 places in 467 ms of which 0 ms to minimize.
[2023-03-16 05:37:24] [INFO ] Deduced a trap composed of 450 places in 465 ms of which 0 ms to minimize.
[2023-03-16 05:37:24] [INFO ] Deduced a trap composed of 442 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:37:25] [INFO ] Deduced a trap composed of 440 places in 471 ms of which 0 ms to minimize.
[2023-03-16 05:37:26] [INFO ] Deduced a trap composed of 450 places in 464 ms of which 2 ms to minimize.
[2023-03-16 05:37:26] [INFO ] Deduced a trap composed of 436 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:37:27] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-16 05:37:27] [INFO ] Deduced a trap composed of 442 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:37:28] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:37:29] [INFO ] Deduced a trap composed of 446 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:37:29] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:37:30] [INFO ] Deduced a trap composed of 448 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:37:30] [INFO ] Deduced a trap composed of 450 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:37:31] [INFO ] Deduced a trap composed of 460 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:37:32] [INFO ] Deduced a trap composed of 442 places in 496 ms of which 1 ms to minimize.
[2023-03-16 05:37:32] [INFO ] Deduced a trap composed of 430 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:37:33] [INFO ] Deduced a trap composed of 436 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:37:33] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 1 ms to minimize.
[2023-03-16 05:37:34] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 0 ms to minimize.
[2023-03-16 05:37:34] [INFO ] Deduced a trap composed of 444 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:37:35] [INFO ] Deduced a trap composed of 438 places in 473 ms of which 0 ms to minimize.
[2023-03-16 05:37:36] [INFO ] Deduced a trap composed of 442 places in 477 ms of which 2 ms to minimize.
[2023-03-16 05:37:37] [INFO ] Deduced a trap composed of 442 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:37:38] [INFO ] Deduced a trap composed of 440 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:37:38] [INFO ] Deduced a trap composed of 438 places in 442 ms of which 1 ms to minimize.
[2023-03-16 05:37:39] [INFO ] Deduced a trap composed of 446 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:37:40] [INFO ] Deduced a trap composed of 448 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:37:41] [INFO ] Deduced a trap composed of 442 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:37:41] [INFO ] Deduced a trap composed of 446 places in 456 ms of which 2 ms to minimize.
[2023-03-16 05:37:42] [INFO ] Deduced a trap composed of 438 places in 443 ms of which 1 ms to minimize.
[2023-03-16 05:37:44] [INFO ] Deduced a trap composed of 438 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:37:45] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 0 ms to minimize.
[2023-03-16 05:37:48] [INFO ] Deduced a trap composed of 434 places in 494 ms of which 1 ms to minimize.
[2023-03-16 05:37:48] [INFO ] Deduced a trap composed of 446 places in 452 ms of which 0 ms to minimize.
[2023-03-16 05:37:49] [INFO ] Deduced a trap composed of 444 places in 473 ms of which 0 ms to minimize.
[2023-03-16 05:37:49] [INFO ] Deduced a trap composed of 436 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:37:50] [INFO ] Deduced a trap composed of 430 places in 442 ms of which 1 ms to minimize.
[2023-03-16 05:37:51] [INFO ] Deduced a trap composed of 428 places in 476 ms of which 1 ms to minimize.
[2023-03-16 05:37:52] [INFO ] Deduced a trap composed of 456 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:37:53] [INFO ] Deduced a trap composed of 432 places in 464 ms of which 1 ms to minimize.
[2023-03-16 05:37:54] [INFO ] Deduced a trap composed of 452 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:37:54] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:37:55] [INFO ] Deduced a trap composed of 434 places in 461 ms of which 0 ms to minimize.
[2023-03-16 05:37:56] [INFO ] Deduced a trap composed of 440 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:37:57] [INFO ] Deduced a trap composed of 434 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:37:59] [INFO ] Deduced a trap composed of 444 places in 476 ms of which 1 ms to minimize.
[2023-03-16 05:37:59] [INFO ] Deduced a trap composed of 442 places in 471 ms of which 1 ms to minimize.
[2023-03-16 05:38:00] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 43693 ms
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 51 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-16 05:38:00] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:38:00] [INFO ] Invariant cache hit.
[2023-03-16 05:38:01] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2023-03-16 05:38:01] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:38:01] [INFO ] Invariant cache hit.
[2023-03-16 05:38:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:38:07] [INFO ] Implicit Places using invariants and state equation in 6220 ms returned []
Implicit Place search using SMT with State Equation took 7366 ms to find 0 implicit places.
[2023-03-16 05:38:07] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-16 05:38:07] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:38:07] [INFO ] Invariant cache hit.
[2023-03-16 05:38:09] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8718 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:38:09] [INFO ] Computed 142 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 697 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2023-03-16 05:38:09] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:38:09] [INFO ] Computed 142 place invariants in 32 ms
[2023-03-16 05:38:09] [INFO ] [Real]Absence check using 135 positive place invariants in 62 ms returned sat
[2023-03-16 05:38:09] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 05:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:38:10] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2023-03-16 05:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:38:10] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:38:10] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 05:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:38:10] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-16 05:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:38:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 953 ms returned sat
[2023-03-16 05:38:12] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:38:12] [INFO ] Deduced a trap composed of 450 places in 431 ms of which 1 ms to minimize.
[2023-03-16 05:38:13] [INFO ] Deduced a trap composed of 438 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:38:13] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:38:14] [INFO ] Deduced a trap composed of 454 places in 447 ms of which 0 ms to minimize.
[2023-03-16 05:38:14] [INFO ] Deduced a trap composed of 452 places in 454 ms of which 1 ms to minimize.
[2023-03-16 05:38:15] [INFO ] Deduced a trap composed of 438 places in 480 ms of which 1 ms to minimize.
[2023-03-16 05:38:15] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 82 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-16 05:38:15] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:38:15] [INFO ] Invariant cache hit.
[2023-03-16 05:38:16] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1243 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:38:16] [INFO ] Computed 142 place invariants in 41 ms
Incomplete random walk after 1000001 steps, including 70217 resets, run finished after 10016 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6971 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 1) seen :3
[2023-03-16 05:38:28] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:38:28] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-16 05:38:28] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-16 05:38:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 05:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:38:29] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2023-03-16 05:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:38:29] [INFO ] [Nat]Absence check using 135 positive place invariants in 62 ms returned sat
[2023-03-16 05:38:29] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-16 05:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:38:30] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-16 05:38:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:38:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 972 ms returned sat
[2023-03-16 05:38:31] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:38:32] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 0 ms to minimize.
[2023-03-16 05:38:32] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:38:33] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:38:33] [INFO ] Deduced a trap composed of 454 places in 436 ms of which 0 ms to minimize.
[2023-03-16 05:38:34] [INFO ] Deduced a trap composed of 452 places in 439 ms of which 1 ms to minimize.
[2023-03-16 05:38:34] [INFO ] Deduced a trap composed of 438 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:38:35] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-16 05:38:35] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 1 ms to minimize.
[2023-03-16 05:38:36] [INFO ] Deduced a trap composed of 454 places in 486 ms of which 1 ms to minimize.
[2023-03-16 05:38:36] [INFO ] Deduced a trap composed of 438 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:38:37] [INFO ] Deduced a trap composed of 438 places in 473 ms of which 1 ms to minimize.
[2023-03-16 05:38:38] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-16 05:38:38] [INFO ] Deduced a trap composed of 452 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:38:39] [INFO ] Deduced a trap composed of 436 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:38:39] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:38:40] [INFO ] Deduced a trap composed of 446 places in 454 ms of which 0 ms to minimize.
[2023-03-16 05:38:40] [INFO ] Deduced a trap composed of 454 places in 473 ms of which 1 ms to minimize.
[2023-03-16 05:38:41] [INFO ] Deduced a trap composed of 452 places in 490 ms of which 1 ms to minimize.
[2023-03-16 05:38:41] [INFO ] Deduced a trap composed of 434 places in 453 ms of which 0 ms to minimize.
[2023-03-16 05:38:42] [INFO ] Deduced a trap composed of 448 places in 497 ms of which 1 ms to minimize.
[2023-03-16 05:38:42] [INFO ] Deduced a trap composed of 442 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:38:44] [INFO ] Deduced a trap composed of 432 places in 443 ms of which 1 ms to minimize.
[2023-03-16 05:38:44] [INFO ] Deduced a trap composed of 456 places in 479 ms of which 1 ms to minimize.
[2023-03-16 05:38:45] [INFO ] Deduced a trap composed of 438 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:38:46] [INFO ] Deduced a trap composed of 446 places in 482 ms of which 1 ms to minimize.
[2023-03-16 05:38:46] [INFO ] Deduced a trap composed of 446 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:38:47] [INFO ] Deduced a trap composed of 436 places in 486 ms of which 1 ms to minimize.
[2023-03-16 05:38:48] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:38:49] [INFO ] Deduced a trap composed of 446 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:38:49] [INFO ] Deduced a trap composed of 446 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:38:50] [INFO ] Deduced a trap composed of 436 places in 503 ms of which 1 ms to minimize.
[2023-03-16 05:38:51] [INFO ] Deduced a trap composed of 436 places in 469 ms of which 0 ms to minimize.
[2023-03-16 05:38:51] [INFO ] Deduced a trap composed of 442 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:38:52] [INFO ] Deduced a trap composed of 432 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:38:52] [INFO ] Deduced a trap composed of 456 places in 468 ms of which 1 ms to minimize.
[2023-03-16 05:38:53] [INFO ] Deduced a trap composed of 450 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:38:53] [INFO ] Deduced a trap composed of 438 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:38:54] [INFO ] Deduced a trap composed of 442 places in 472 ms of which 1 ms to minimize.
[2023-03-16 05:38:55] [INFO ] Deduced a trap composed of 448 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:38:55] [INFO ] Deduced a trap composed of 444 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:38:56] [INFO ] Deduced a trap composed of 430 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:38:56] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-16 05:38:57] [INFO ] Deduced a trap composed of 438 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:38:57] [INFO ] Deduced a trap composed of 440 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:38:58] [INFO ] Deduced a trap composed of 434 places in 454 ms of which 1 ms to minimize.
[2023-03-16 05:38:59] [INFO ] Deduced a trap composed of 440 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:39:00] [INFO ] Deduced a trap composed of 444 places in 433 ms of which 1 ms to minimize.
[2023-03-16 05:39:00] [INFO ] Deduced a trap composed of 440 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:39:01] [INFO ] Deduced a trap composed of 440 places in 496 ms of which 1 ms to minimize.
[2023-03-16 05:39:02] [INFO ] Deduced a trap composed of 440 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:39:04] [INFO ] Deduced a trap composed of 432 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:39:05] [INFO ] Deduced a trap composed of 442 places in 460 ms of which 1 ms to minimize.
[2023-03-16 05:39:05] [INFO ] Deduced a trap composed of 444 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:39:06] [INFO ] Deduced a trap composed of 444 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:39:06] [INFO ] Deduced a trap composed of 448 places in 488 ms of which 1 ms to minimize.
[2023-03-16 05:39:07] [INFO ] Deduced a trap composed of 446 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:39:10] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 39446 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 43 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-16 05:39:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:39:10] [INFO ] Invariant cache hit.
[2023-03-16 05:39:11] [INFO ] Implicit Places using invariants in 967 ms returned []
[2023-03-16 05:39:11] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:39:11] [INFO ] Invariant cache hit.
[2023-03-16 05:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:39:18] [INFO ] Implicit Places using invariants and state equation in 7265 ms returned []
Implicit Place search using SMT with State Equation took 8276 ms to find 0 implicit places.
[2023-03-16 05:39:19] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-16 05:39:19] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:39:19] [INFO ] Invariant cache hit.
[2023-03-16 05:39:20] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9586 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00 in 71062 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:39:20] [INFO ] Computed 142 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 689 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :3
[2023-03-16 05:39:20] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:39:20] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-16 05:39:20] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 05:39:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 05:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:39:21] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-16 05:39:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:39:21] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2023-03-16 05:39:21] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 05:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:39:21] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-16 05:39:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:39:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 636 ms returned sat
[2023-03-16 05:39:22] [INFO ] Deduced a trap composed of 442 places in 450 ms of which 0 ms to minimize.
[2023-03-16 05:39:23] [INFO ] Deduced a trap composed of 434 places in 438 ms of which 0 ms to minimize.
[2023-03-16 05:39:23] [INFO ] Deduced a trap composed of 438 places in 437 ms of which 1 ms to minimize.
[2023-03-16 05:39:24] [INFO ] Deduced a trap composed of 434 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:39:25] [INFO ] Deduced a trap composed of 438 places in 474 ms of which 1 ms to minimize.
[2023-03-16 05:39:25] [INFO ] Deduced a trap composed of 436 places in 466 ms of which 0 ms to minimize.
[2023-03-16 05:39:26] [INFO ] Deduced a trap composed of 444 places in 458 ms of which 0 ms to minimize.
[2023-03-16 05:39:26] [INFO ] Deduced a trap composed of 436 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:39:26] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 58 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-16 05:39:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:39:26] [INFO ] Invariant cache hit.
[2023-03-16 05:39:27] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:39:27] [INFO ] Computed 142 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 70401 resets, run finished after 10077 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7330 resets, run finished after 1976 ms. (steps per millisecond=506 ) properties (out of 1) seen :3
[2023-03-16 05:39:39] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-16 05:39:39] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-16 05:39:40] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-16 05:39:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 05:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 05:39:40] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-16 05:39:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 05:39:40] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-16 05:39:40] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-16 05:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 05:39:41] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2023-03-16 05:39:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:39:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 671 ms returned sat
[2023-03-16 05:39:42] [INFO ] Deduced a trap composed of 442 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:39:43] [INFO ] Deduced a trap composed of 434 places in 479 ms of which 1 ms to minimize.
[2023-03-16 05:39:43] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:39:44] [INFO ] Deduced a trap composed of 434 places in 488 ms of which 0 ms to minimize.
[2023-03-16 05:39:44] [INFO ] Deduced a trap composed of 438 places in 470 ms of which 1 ms to minimize.
[2023-03-16 05:39:45] [INFO ] Deduced a trap composed of 436 places in 451 ms of which 1 ms to minimize.
[2023-03-16 05:39:45] [INFO ] Deduced a trap composed of 444 places in 456 ms of which 1 ms to minimize.
[2023-03-16 05:39:46] [INFO ] Deduced a trap composed of 436 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:39:46] [INFO ] Deduced a trap composed of 450 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:39:47] [INFO ] Deduced a trap composed of 438 places in 473 ms of which 1 ms to minimize.
[2023-03-16 05:39:48] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:39:48] [INFO ] Deduced a trap composed of 438 places in 471 ms of which 1 ms to minimize.
[2023-03-16 05:39:49] [INFO ] Deduced a trap composed of 448 places in 461 ms of which 0 ms to minimize.
[2023-03-16 05:39:49] [INFO ] Deduced a trap composed of 450 places in 455 ms of which 1 ms to minimize.
[2023-03-16 05:39:50] [INFO ] Deduced a trap composed of 442 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:39:51] [INFO ] Deduced a trap composed of 440 places in 463 ms of which 0 ms to minimize.
[2023-03-16 05:39:51] [INFO ] Deduced a trap composed of 450 places in 466 ms of which 1 ms to minimize.
[2023-03-16 05:39:52] [INFO ] Deduced a trap composed of 436 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:39:53] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 0 ms to minimize.
[2023-03-16 05:39:53] [INFO ] Deduced a trap composed of 442 places in 450 ms of which 1 ms to minimize.
[2023-03-16 05:39:54] [INFO ] Deduced a trap composed of 446 places in 457 ms of which 1 ms to minimize.
[2023-03-16 05:39:54] [INFO ] Deduced a trap composed of 446 places in 487 ms of which 1 ms to minimize.
[2023-03-16 05:39:55] [INFO ] Deduced a trap composed of 448 places in 464 ms of which 1 ms to minimize.
[2023-03-16 05:39:55] [INFO ] Deduced a trap composed of 448 places in 456 ms of which 1 ms to minimize.
[2023-03-16 05:39:56] [INFO ] Deduced a trap composed of 450 places in 485 ms of which 1 ms to minimize.
[2023-03-16 05:39:57] [INFO ] Deduced a trap composed of 460 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:39:57] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 0 ms to minimize.
[2023-03-16 05:39:58] [INFO ] Deduced a trap composed of 430 places in 454 ms of which 1 ms to minimize.
[2023-03-16 05:39:58] [INFO ] Deduced a trap composed of 436 places in 477 ms of which 1 ms to minimize.
[2023-03-16 05:39:59] [INFO ] Deduced a trap composed of 446 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:40:00] [INFO ] Deduced a trap composed of 438 places in 469 ms of which 1 ms to minimize.
[2023-03-16 05:40:00] [INFO ] Deduced a trap composed of 444 places in 458 ms of which 1 ms to minimize.
[2023-03-16 05:40:01] [INFO ] Deduced a trap composed of 438 places in 450 ms of which 0 ms to minimize.
[2023-03-16 05:40:02] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:40:03] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 1 ms to minimize.
[2023-03-16 05:40:03] [INFO ] Deduced a trap composed of 440 places in 452 ms of which 1 ms to minimize.
[2023-03-16 05:40:04] [INFO ] Deduced a trap composed of 438 places in 465 ms of which 1 ms to minimize.
[2023-03-16 05:40:05] [INFO ] Deduced a trap composed of 446 places in 443 ms of which 0 ms to minimize.
[2023-03-16 05:40:06] [INFO ] Deduced a trap composed of 448 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:40:06] [INFO ] Deduced a trap composed of 442 places in 454 ms of which 1 ms to minimize.
[2023-03-16 05:40:07] [INFO ] Deduced a trap composed of 446 places in 456 ms of which 0 ms to minimize.
[2023-03-16 05:40:07] [INFO ] Deduced a trap composed of 438 places in 463 ms of which 1 ms to minimize.
[2023-03-16 05:40:09] [INFO ] Deduced a trap composed of 438 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:40:10] [INFO ] Deduced a trap composed of 444 places in 431 ms of which 1 ms to minimize.
[2023-03-16 05:40:13] [INFO ] Deduced a trap composed of 434 places in 453 ms of which 1 ms to minimize.
[2023-03-16 05:40:14] [INFO ] Deduced a trap composed of 446 places in 445 ms of which 1 ms to minimize.
[2023-03-16 05:40:14] [INFO ] Deduced a trap composed of 444 places in 441 ms of which 1 ms to minimize.
[2023-03-16 05:40:15] [INFO ] Deduced a trap composed of 436 places in 449 ms of which 1 ms to minimize.
[2023-03-16 05:40:16] [INFO ] Deduced a trap composed of 430 places in 447 ms of which 1 ms to minimize.
[2023-03-16 05:40:16] [INFO ] Deduced a trap composed of 428 places in 470 ms of which 1 ms to minimize.
[2023-03-16 05:40:17] [INFO ] Deduced a trap composed of 456 places in 478 ms of which 1 ms to minimize.
[2023-03-16 05:40:19] [INFO ] Deduced a trap composed of 432 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:40:20] [INFO ] Deduced a trap composed of 452 places in 479 ms of which 1 ms to minimize.
[2023-03-16 05:40:20] [INFO ] Deduced a trap composed of 448 places in 467 ms of which 1 ms to minimize.
[2023-03-16 05:40:21] [INFO ] Deduced a trap composed of 434 places in 462 ms of which 1 ms to minimize.
[2023-03-16 05:40:22] [INFO ] Deduced a trap composed of 440 places in 435 ms of which 1 ms to minimize.
[2023-03-16 05:40:23] [INFO ] Deduced a trap composed of 434 places in 475 ms of which 1 ms to minimize.
[2023-03-16 05:40:25] [INFO ] Deduced a trap composed of 444 places in 477 ms of which 1 ms to minimize.
[2023-03-16 05:40:25] [INFO ] Deduced a trap composed of 442 places in 459 ms of which 1 ms to minimize.
[2023-03-16 05:40:25] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 43682 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 49 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 44 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-16 05:40:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:40:25] [INFO ] Invariant cache hit.
[2023-03-16 05:40:26] [INFO ] Implicit Places using invariants in 916 ms returned []
[2023-03-16 05:40:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:40:26] [INFO ] Invariant cache hit.
[2023-03-16 05:40:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:40:34] [INFO ] Implicit Places using invariants and state equation in 7695 ms returned []
Implicit Place search using SMT with State Equation took 8613 ms to find 0 implicit places.
[2023-03-16 05:40:34] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-16 05:40:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-16 05:40:34] [INFO ] Invariant cache hit.
[2023-03-16 05:40:35] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9818 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04 in 75420 ms.
[2023-03-16 05:40:35] [INFO ] Flatten gal took : 255 ms
[2023-03-16 05:40:36] [INFO ] Applying decomposition
[2023-03-16 05:40:36] [INFO ] Flatten gal took : 193 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14070496294353662593.txt' '-o' '/tmp/graph14070496294353662593.bin' '-w' '/tmp/graph14070496294353662593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14070496294353662593.bin' '-l' '-1' '-v' '-w' '/tmp/graph14070496294353662593.weights' '-q' '0' '-e' '0.001'
[2023-03-16 05:40:36] [INFO ] Decomposing Gal with order
[2023-03-16 05:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 05:40:37] [INFO ] Removed a total of 4059 redundant transitions.
[2023-03-16 05:40:37] [INFO ] Flatten gal took : 482 ms
[2023-03-16 05:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 102 ms.
[2023-03-16 05:40:37] [INFO ] Time to serialize gal into /tmp/UpperBounds16736827363544326966.gal : 115 ms
[2023-03-16 05:40:37] [INFO ] Time to serialize properties into /tmp/UpperBounds2266204473648409942.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16736827363544326966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2266204473648409942.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2266204473648409942.prop.
Detected timeout of ITS tools.
[2023-03-16 06:03:03] [INFO ] Applying decomposition
[2023-03-16 06:03:04] [INFO ] Flatten gal took : 721 ms
[2023-03-16 06:03:04] [INFO ] Decomposing Gal with order
[2023-03-16 06:03:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:03:18] [INFO ] Removed a total of 9599 redundant transitions.
[2023-03-16 06:03:19] [INFO ] Flatten gal took : 2505 ms
[2023-03-16 06:03:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 205 ms.
[2023-03-16 06:03:19] [INFO ] Time to serialize gal into /tmp/UpperBounds12833795877460906075.gal : 152 ms
[2023-03-16 06:03:19] [INFO ] Time to serialize properties into /tmp/UpperBounds5073856088650225790.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12833795877460906075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5073856088650225790.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds5073856088650225790.prop.
Detected timeout of ITS tools.
[2023-03-16 06:26:15] [INFO ] Flatten gal took : 705 ms
[2023-03-16 06:26:16] [INFO ] Input system was already deterministic with 2062 transitions.
[2023-03-16 06:26:16] [INFO ] Transformed 1091 places.
[2023-03-16 06:26:16] [INFO ] Transformed 2062 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 06:26:58] [INFO ] Time to serialize gal into /tmp/UpperBounds5120569668601383522.gal : 14 ms
[2023-03-16 06:26:58] [INFO ] Time to serialize properties into /tmp/UpperBounds15510312748425617282.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5120569668601383522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15510312748425617282.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15510312748425617282.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6386724 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16227800 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J60, 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 r293-tall-167873945800701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 ;