About the Execution of Marcie+red for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5591.655 | 3600000.00 | 3697995.00 | 8701.10 | ? 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.r298-tall-167873952100701.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 marciexred
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 r298-tall-167873952100701
=====================================================================
--------------------
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 1679640477058
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 06:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 06:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:47:58] [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-24 06:47:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 06:47:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2023-03-24 06:47:59] [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-24 06:47:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 06:47:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 06:47:59] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-24 06:47:59] [INFO ] Invariant cache hit.
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-24 06:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-24 06:47:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:47:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:47:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
[2023-03-24 06:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-24 06:47:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 06:47:59] [INFO ] Added : 21 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 61 ms.
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:47:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-24 06:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:47:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-24 06:47:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:47:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-24 06:47:59] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-24 06:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-24 06:47:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 06:47:59] [INFO ] Added : 36 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 17 ms.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 06:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-24 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-24 06:48:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:00] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2023-03-24 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-24 06:48:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:00] [INFO ] Added : 15 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-24 06:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 06:48:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-24 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-24 06:48:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:00] [INFO ] Added : 14 causal constraints over 4 iterations in 242 ms. Result :sat
Minimization took 81 ms.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:00] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-24 06:48:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-24 06:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-24 06:48:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:01] [INFO ] Added : 20 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-24 06:48:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-24 06:48:01] [INFO ] Added : 33 causal constraints over 7 iterations in 144 ms. Result :sat
Minimization took 25 ms.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:01] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 86 ms
[2023-03-24 06:48:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:01] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-24 06:48:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2023-03-24 06:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-24 06:48:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 06:48:01] [INFO ] Added : 20 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-24 06:48:02] [INFO ] Added : 36 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 06:48:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-24 06:48:02] [INFO ] Added : 36 causal constraints over 8 iterations in 169 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 06:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-24 06:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-24 06:48:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-24 06:48:02] [INFO ] Added : 20 causal constraints over 4 iterations in 223 ms. Result :sat
Minimization took 73 ms.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 06:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 06:48:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:03] [INFO ] Added : 36 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 06:48:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-24 06:48:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 06:48:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 06:48:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 06:48:03] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-24 06:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-24 06:48:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 06:48:03] [INFO ] Added : 19 causal constraints over 4 iterations in 279 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-24 06:48:03] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 213 ms.
[2023-03-24 06:48:03] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 31 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 559 resets, run finished after 254 ms. (steps per millisecond=39 ) 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 105 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 39 ms. (steps per millisecond=256 ) 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 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 105 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 105 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 10000 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :1
[2023-03-24 06:48:04] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-24 06:48:04] [INFO ] Computed 152 place invariants in 214 ms
[2023-03-24 06:48:04] [INFO ] [Real]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:05] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-24 06:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:05] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2023-03-24 06:48:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-24 06:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:10] [INFO ] [Nat]Absence check using state equation in 4828 ms returned unknown
[2023-03-24 06:48:11] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:11] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:11] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-24 06:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:12] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:12] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:14] [INFO ] [Nat]Absence check using state equation in 1744 ms returned sat
[2023-03-24 06:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:48:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1239 ms returned sat
[2023-03-24 06:48:15] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 292 ms.
[2023-03-24 06:48:17] [INFO ] Deduced a trap composed of 19 places in 738 ms of which 2 ms to minimize.
[2023-03-24 06:48:17] [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.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-24 06:48:17] [INFO ] [Real]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:17] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-24 06:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:18] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2023-03-24 06:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:18] [INFO ] [Nat]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:19] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-24 06:48:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:20] [INFO ] [Nat]Absence check using state equation in 1592 ms returned sat
[2023-03-24 06:48:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-24 06:48:21] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 600 ms.
[2023-03-24 06:48:21] [INFO ] Added : 6 causal constraints over 2 iterations in 975 ms. Result :sat
Minimization took 520 ms.
[2023-03-24 06:48:22] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:22] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:23] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2023-03-24 06:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:23] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:23] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-24 06:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:25] [INFO ] [Nat]Absence check using state equation in 2293 ms returned sat
[2023-03-24 06:48:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2023-03-24 06:48:26] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 200 ms.
[2023-03-24 06:48:26] [INFO ] Added : 7 causal constraints over 2 iterations in 582 ms. Result :sat
Minimization took 799 ms.
[2023-03-24 06:48:27] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:27] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-24 06:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:28] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2023-03-24 06:48:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:28] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:28] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:33] [INFO ] [Nat]Absence check using state equation in 4824 ms returned unknown
[2023-03-24 06:48:33] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-24 06:48:33] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:34] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2023-03-24 06:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:34] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:34] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-24 06:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:39] [INFO ] [Nat]Absence check using state equation in 4810 ms returned unknown
[2023-03-24 06:48:39] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-24 06:48:39] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-24 06:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:40] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2023-03-24 06:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:40] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:40] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:44] [INFO ] [Nat]Absence check using state equation in 3177 ms returned sat
[2023-03-24 06:48:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1387 ms returned sat
[2023-03-24 06:48:46] [INFO ] Deduced a trap composed of 266 places in 655 ms of which 14 ms to minimize.
[2023-03-24 06:48:46] [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 6
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: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-24 06:48:46] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:48:46] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned unsat
[2023-03-24 06:48:46] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-24 06:48:46] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-24 06:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:47] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2023-03-24 06:48:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:47] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-24 06:48:47] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2023-03-24 06:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:49] [INFO ] [Nat]Absence check using state equation in 1493 ms returned sat
[2023-03-24 06:48:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 269 ms returned sat
[2023-03-24 06:48:49] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 219 ms.
[2023-03-24 06:48:51] [INFO ] Deduced a trap composed of 19 places in 765 ms of which 1 ms to minimize.
[2023-03-24 06:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 967 ms
[2023-03-24 06:48:51] [INFO ] Added : 23 causal constraints over 5 iterations in 2030 ms. Result :sat
Minimization took 903 ms.
[2023-03-24 06:48:52] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-24 06:48:52] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-24 06:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:53] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2023-03-24 06:48:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:53] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-24 06:48:53] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-24 06:48:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:57] [INFO ] [Nat]Absence check using state equation in 3148 ms returned sat
[2023-03-24 06:48:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 80 ms returned sat
[2023-03-24 06:48:57] [INFO ] Deduced a trap composed of 506 places in 698 ms of which 2 ms to minimize.
[2023-03-24 06:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1036 ms
[2023-03-24 06:48:58] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 209 ms.
[2023-03-24 06:48:58] [INFO ] Added : 10 causal constraints over 2 iterations in 538 ms. Result :unknown
[2023-03-24 06:48:58] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-24 06:48:58] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-24 06:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:48:59] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2023-03-24 06:48:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:48:59] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:48:59] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 56 ms returned sat
[2023-03-24 06:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:00] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2023-03-24 06:49:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 318 ms returned sat
[2023-03-24 06:49:01] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 206 ms.
[2023-03-24 06:49:01] [INFO ] Added : 12 causal constraints over 3 iterations in 720 ms. Result :sat
Minimization took 2882 ms.
[2023-03-24 06:49:04] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-24 06:49:04] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-24 06:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:05] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2023-03-24 06:49:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:49:05] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-24 06:49:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-24 06:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:07] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2023-03-24 06:49:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 537 ms returned sat
[2023-03-24 06:49:07] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 195 ms.
[2023-03-24 06:49:09] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 1 ms to minimize.
[2023-03-24 06:49:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2023-03-24 06:49:09] [INFO ] Added : 27 causal constraints over 6 iterations in 1935 ms. Result :sat
Minimization took 1150 ms.
[2023-03-24 06:49:11] [INFO ] [Real]Absence check using 145 positive place invariants in 43 ms returned sat
[2023-03-24 06:49:11] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-24 06:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:11] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2023-03-24 06:49:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:49:12] [INFO ] [Nat]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-24 06:49:12] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 06:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:17] [INFO ] [Nat]Absence check using state equation in 4814 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 2147483647, 1, 1, 10, 2, 1, 1, 2147483647, 2, 4, 2147483647, 10] Max seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
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 70 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 516 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
[2023-03-24 06:49:17] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2023-03-24 06:49:17] [INFO ] Computed 142 place invariants in 91 ms
[2023-03-24 06:49:19] [INFO ] Dead Transitions using invariants and state equation in 1454 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 75 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 2051 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-24 06:49:19] [INFO ] Computed 142 place invariants in 68 ms
Incomplete random walk after 1000000 steps, including 68931 resets, run finished after 10390 ms. (steps per millisecond=96 ) properties (out of 10) seen :22
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7287 resets, run finished after 1953 ms. (steps per millisecond=512 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 7341 resets, run finished after 1963 ms. (steps per millisecond=509 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 1000000 steps, including 7046 resets, run finished after 1926 ms. (steps per millisecond=519 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 7310 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 1000000 steps, including 7217 resets, run finished after 1975 ms. (steps per millisecond=506 ) properties (out of 6) seen :13
Incomplete Best-First random walk after 1000001 steps, including 7150 resets, run finished after 2879 ms. (steps per millisecond=347 ) properties (out of 6) seen :9
[2023-03-24 06:49:42] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-24 06:49:42] [INFO ] Computed 142 place invariants in 49 ms
[2023-03-24 06:49:42] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 06:49:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 06:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:43] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2023-03-24 06:49:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:49:43] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-24 06:49:43] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-24 06:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:49:43] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-24 06:49:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:49:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 569 ms returned sat
[2023-03-24 06:49:44] [INFO ] Deduced a trap composed of 447 places in 458 ms of which 0 ms to minimize.
[2023-03-24 06:49:45] [INFO ] Deduced a trap composed of 447 places in 478 ms of which 1 ms to minimize.
[2023-03-24 06:49:45] [INFO ] Deduced a trap composed of 445 places in 477 ms of which 1 ms to minimize.
[2023-03-24 06:49:46] [INFO ] Deduced a trap composed of 445 places in 507 ms of which 1 ms to minimize.
[2023-03-24 06:49:46] [INFO ] Deduced a trap composed of 447 places in 463 ms of which 1 ms to minimize.
[2023-03-24 06:49:47] [INFO ] Deduced a trap composed of 443 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:49:48] [INFO ] Deduced a trap composed of 437 places in 451 ms of which 0 ms to minimize.
[2023-03-24 06:49:48] [INFO ] Deduced a trap composed of 445 places in 461 ms of which 2 ms to minimize.
[2023-03-24 06:49:49] [INFO ] Deduced a trap composed of 449 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:49:49] [INFO ] Deduced a trap composed of 445 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:49:50] [INFO ] Deduced a trap composed of 445 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:49:50] [INFO ] Deduced a trap composed of 445 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:49:51] [INFO ] Deduced a trap composed of 441 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:49:52] [INFO ] Deduced a trap composed of 449 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:49:52] [INFO ] Deduced a trap composed of 451 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:49:53] [INFO ] Deduced a trap composed of 439 places in 450 ms of which 1 ms to minimize.
[2023-03-24 06:49:53] [INFO ] Deduced a trap composed of 441 places in 484 ms of which 1 ms to minimize.
[2023-03-24 06:49:54] [INFO ] Deduced a trap composed of 447 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:49:54] [INFO ] Deduced a trap composed of 443 places in 542 ms of which 1 ms to minimize.
[2023-03-24 06:49:55] [INFO ] Deduced a trap composed of 445 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:49:56] [INFO ] Deduced a trap composed of 451 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:49:56] [INFO ] Deduced a trap composed of 433 places in 437 ms of which 1 ms to minimize.
[2023-03-24 06:49:57] [INFO ] Deduced a trap composed of 425 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:49:57] [INFO ] Deduced a trap composed of 437 places in 430 ms of which 1 ms to minimize.
[2023-03-24 06:49:58] [INFO ] Deduced a trap composed of 445 places in 488 ms of which 1 ms to minimize.
[2023-03-24 06:49:58] [INFO ] Deduced a trap composed of 437 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:49:59] [INFO ] Deduced a trap composed of 443 places in 422 ms of which 1 ms to minimize.
[2023-03-24 06:49:59] [INFO ] Deduced a trap composed of 439 places in 440 ms of which 1 ms to minimize.
[2023-03-24 06:50:00] [INFO ] Deduced a trap composed of 439 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:50:01] [INFO ] Deduced a trap composed of 447 places in 485 ms of which 1 ms to minimize.
[2023-03-24 06:50:02] [INFO ] Deduced a trap composed of 445 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:50:02] [INFO ] Deduced a trap composed of 441 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:50:03] [INFO ] Deduced a trap composed of 445 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:50:03] [INFO ] Deduced a trap composed of 451 places in 458 ms of which 10 ms to minimize.
[2023-03-24 06:50:04] [INFO ] Deduced a trap composed of 453 places in 449 ms of which 0 ms to minimize.
[2023-03-24 06:50:05] [INFO ] Deduced a trap composed of 431 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:50:06] [INFO ] Deduced a trap composed of 443 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:50:06] [INFO ] Deduced a trap composed of 447 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:50:07] [INFO ] Deduced a trap composed of 447 places in 519 ms of which 1 ms to minimize.
[2023-03-24 06:50:07] [INFO ] Deduced a trap composed of 451 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:50:08] [INFO ] Deduced a trap composed of 441 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:50:09] [INFO ] Deduced a trap composed of 445 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:50:09] [INFO ] Deduced a trap composed of 441 places in 440 ms of which 2 ms to minimize.
[2023-03-24 06:50:10] [INFO ] Deduced a trap composed of 445 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:50:11] [INFO ] Deduced a trap composed of 439 places in 423 ms of which 1 ms to minimize.
[2023-03-24 06:50:11] [INFO ] Deduced a trap composed of 449 places in 430 ms of which 2 ms to minimize.
[2023-03-24 06:50:12] [INFO ] Deduced a trap composed of 445 places in 455 ms of which 2 ms to minimize.
[2023-03-24 06:50:13] [INFO ] Deduced a trap composed of 449 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:50:13] [INFO ] Deduced a trap composed of 451 places in 437 ms of which 1 ms to minimize.
[2023-03-24 06:50:14] [INFO ] Deduced a trap composed of 447 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:50:14] [INFO ] Deduced a trap composed of 439 places in 424 ms of which 1 ms to minimize.
[2023-03-24 06:50:15] [INFO ] Deduced a trap composed of 447 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:50:16] [INFO ] Deduced a trap composed of 447 places in 459 ms of which 0 ms to minimize.
[2023-03-24 06:50:16] [INFO ] Deduced a trap composed of 449 places in 460 ms of which 1 ms to minimize.
[2023-03-24 06:50:17] [INFO ] Deduced a trap composed of 451 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:50:17] [INFO ] Deduced a trap composed of 453 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:50:18] [INFO ] Deduced a trap composed of 447 places in 482 ms of which 1 ms to minimize.
[2023-03-24 06:50:19] [INFO ] Deduced a trap composed of 447 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:50:20] [INFO ] Deduced a trap composed of 443 places in 432 ms of which 1 ms to minimize.
[2023-03-24 06:50:21] [INFO ] Deduced a trap composed of 433 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:50:22] [INFO ] Deduced a trap composed of 447 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:50:23] [INFO ] Deduced a trap composed of 455 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:50:23] [INFO ] Deduced a trap composed of 433 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:50:24] [INFO ] Deduced a trap composed of 443 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:50:25] [INFO ] Deduced a trap composed of 441 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:50:26] [INFO ] Deduced a trap composed of 443 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:50:26] [INFO ] Deduced a trap composed of 447 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:50:28] [INFO ] Trap strengthening (SAT) tested/added 67/67 trap constraints in 43794 ms
[2023-03-24 06:50:28] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-24 06:50:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-24 06:50:28] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 06:50:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-24 06:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:50:28] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-03-24 06:50:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:50:29] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-24 06:50:29] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-24 06:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:50:29] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2023-03-24 06:50:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 568 ms returned sat
[2023-03-24 06:50:30] [INFO ] Deduced a trap composed of 431 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:50:31] [INFO ] Deduced a trap composed of 435 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:50:31] [INFO ] Deduced a trap composed of 445 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:50:32] [INFO ] Deduced a trap composed of 439 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:50:32] [INFO ] Deduced a trap composed of 443 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:50:33] [INFO ] Deduced a trap composed of 445 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:50:34] [INFO ] Deduced a trap composed of 443 places in 437 ms of which 1 ms to minimize.
[2023-03-24 06:50:34] [INFO ] Deduced a trap composed of 447 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:50:35] [INFO ] Deduced a trap composed of 441 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:50:35] [INFO ] Deduced a trap composed of 455 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:50:36] [INFO ] Deduced a trap composed of 435 places in 460 ms of which 1 ms to minimize.
[2023-03-24 06:50:36] [INFO ] Deduced a trap composed of 443 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:50:37] [INFO ] Deduced a trap composed of 447 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:50:37] [INFO ] Deduced a trap composed of 445 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:50:38] [INFO ] Deduced a trap composed of 461 places in 430 ms of which 1 ms to minimize.
[2023-03-24 06:50:39] [INFO ] Deduced a trap composed of 443 places in 432 ms of which 0 ms to minimize.
[2023-03-24 06:50:39] [INFO ] Deduced a trap composed of 441 places in 420 ms of which 1 ms to minimize.
[2023-03-24 06:50:40] [INFO ] Deduced a trap composed of 445 places in 421 ms of which 1 ms to minimize.
[2023-03-24 06:50:40] [INFO ] Deduced a trap composed of 455 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:50:41] [INFO ] Deduced a trap composed of 447 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:50:41] [INFO ] Deduced a trap composed of 445 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:50:42] [INFO ] Deduced a trap composed of 445 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:50:42] [INFO ] Deduced a trap composed of 444 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:50:44] [INFO ] Deduced a trap composed of 445 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:50:45] [INFO ] Deduced a trap composed of 453 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:50:46] [INFO ] Deduced a trap composed of 457 places in 481 ms of which 0 ms to minimize.
[2023-03-24 06:50:46] [INFO ] Deduced a trap composed of 447 places in 467 ms of which 0 ms to minimize.
[2023-03-24 06:50:48] [INFO ] Deduced a trap composed of 443 places in 469 ms of which 1 ms to minimize.
[2023-03-24 06:50:48] [INFO ] Deduced a trap composed of 439 places in 463 ms of which 1 ms to minimize.
[2023-03-24 06:50:49] [INFO ] Deduced a trap composed of 441 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:50:49] [INFO ] Deduced a trap composed of 449 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:50:50] [INFO ] Deduced a trap composed of 443 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:50:50] [INFO ] Deduced a trap composed of 443 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:50:51] [INFO ] Deduced a trap composed of 439 places in 437 ms of which 1 ms to minimize.
[2023-03-24 06:50:51] [INFO ] Deduced a trap composed of 453 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:50:52] [INFO ] Deduced a trap composed of 433 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:50:53] [INFO ] Deduced a trap composed of 449 places in 468 ms of which 1 ms to minimize.
[2023-03-24 06:50:53] [INFO ] Deduced a trap composed of 435 places in 472 ms of which 1 ms to minimize.
[2023-03-24 06:50:54] [INFO ] Deduced a trap composed of 445 places in 476 ms of which 1 ms to minimize.
[2023-03-24 06:50:54] [INFO ] Deduced a trap composed of 447 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:50:55] [INFO ] Deduced a trap composed of 453 places in 470 ms of which 1 ms to minimize.
[2023-03-24 06:50:55] [INFO ] Deduced a trap composed of 453 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:50:56] [INFO ] Deduced a trap composed of 455 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:50:57] [INFO ] Deduced a trap composed of 439 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:50:58] [INFO ] Deduced a trap composed of 443 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:50:58] [INFO ] Deduced a trap composed of 453 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:50:59] [INFO ] Deduced a trap composed of 447 places in 435 ms of which 0 ms to minimize.
[2023-03-24 06:50:59] [INFO ] Deduced a trap composed of 449 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:51:00] [INFO ] Deduced a trap composed of 445 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:51:01] [INFO ] Deduced a trap composed of 449 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:51:01] [INFO ] Deduced a trap composed of 451 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:51:02] [INFO ] Deduced a trap composed of 451 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:51:02] [INFO ] Deduced a trap composed of 455 places in 456 ms of which 2 ms to minimize.
[2023-03-24 06:51:03] [INFO ] Deduced a trap composed of 443 places in 457 ms of which 0 ms to minimize.
[2023-03-24 06:51:04] [INFO ] Deduced a trap composed of 449 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:51:05] [INFO ] Deduced a trap composed of 445 places in 469 ms of which 1 ms to minimize.
[2023-03-24 06:51:05] [INFO ] Deduced a trap composed of 445 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:51:06] [INFO ] Deduced a trap composed of 453 places in 492 ms of which 1 ms to minimize.
[2023-03-24 06:51:06] [INFO ] Deduced a trap composed of 443 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:51:07] [INFO ] Deduced a trap composed of 445 places in 451 ms of which 0 ms to minimize.
[2023-03-24 06:51:08] [INFO ] Deduced a trap composed of 447 places in 487 ms of which 0 ms to minimize.
[2023-03-24 06:51:09] [INFO ] Deduced a trap composed of 449 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:51:10] [INFO ] Deduced a trap composed of 443 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:51:11] [INFO ] Deduced a trap composed of 429 places in 483 ms of which 1 ms to minimize.
[2023-03-24 06:51:11] [INFO ] Deduced a trap composed of 447 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:51:12] [INFO ] Deduced a trap composed of 453 places in 452 ms of which 0 ms to minimize.
[2023-03-24 06:51:14] [INFO ] Deduced a trap composed of 463 places in 489 ms of which 1 ms to minimize.
[2023-03-24 06:51:14] [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 2
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: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-24 06:51:14] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 06:51:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-24 06:51:14] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-24 06:51:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-24 06:51:14] [INFO ] [Real]Absence check using 135 positive place invariants in 57 ms returned sat
[2023-03-24 06:51:14] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 10, 1, 1, 4] Max seen :[3, 1, 3, 1, 1, 4]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
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 214 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 215 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-24 06:51:15] [INFO ] Computed 142 place invariants in 65 ms
Incomplete random walk after 1000000 steps, including 70478 resets, run finished after 9407 ms. (steps per millisecond=106 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 7483 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6893 resets, run finished after 1822 ms. (steps per millisecond=548 ) properties (out of 2) seen :4
[2023-03-24 06:51:28] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-24 06:51:28] [INFO ] Computed 142 place invariants in 54 ms
[2023-03-24 06:51:28] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 06:51:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 06:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:51:29] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-24 06:51:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:51:29] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-24 06:51:29] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 06:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:51:29] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-24 06:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:51:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 954 ms returned sat
[2023-03-24 06:51:31] [INFO ] Deduced a trap composed of 444 places in 502 ms of which 1 ms to minimize.
[2023-03-24 06:51:31] [INFO ] Deduced a trap composed of 450 places in 478 ms of which 1 ms to minimize.
[2023-03-24 06:51:32] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:51:32] [INFO ] Deduced a trap composed of 442 places in 481 ms of which 1 ms to minimize.
[2023-03-24 06:51:33] [INFO ] Deduced a trap composed of 454 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:51:33] [INFO ] Deduced a trap composed of 452 places in 496 ms of which 1 ms to minimize.
[2023-03-24 06:51:34] [INFO ] Deduced a trap composed of 438 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:51:34] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-24 06:51:35] [INFO ] Deduced a trap composed of 444 places in 435 ms of which 1 ms to minimize.
[2023-03-24 06:51:35] [INFO ] Deduced a trap composed of 454 places in 450 ms of which 1 ms to minimize.
[2023-03-24 06:51:36] [INFO ] Deduced a trap composed of 438 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:51:37] [INFO ] Deduced a trap composed of 438 places in 468 ms of which 1 ms to minimize.
[2023-03-24 06:51:37] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:51:38] [INFO ] Deduced a trap composed of 452 places in 468 ms of which 1 ms to minimize.
[2023-03-24 06:51:38] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:51:39] [INFO ] Deduced a trap composed of 436 places in 486 ms of which 0 ms to minimize.
[2023-03-24 06:51:39] [INFO ] Deduced a trap composed of 446 places in 430 ms of which 1 ms to minimize.
[2023-03-24 06:51:40] [INFO ] Deduced a trap composed of 454 places in 485 ms of which 0 ms to minimize.
[2023-03-24 06:51:40] [INFO ] Deduced a trap composed of 452 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:51:41] [INFO ] Deduced a trap composed of 434 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:51:42] [INFO ] Deduced a trap composed of 448 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:51:42] [INFO ] Deduced a trap composed of 442 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:51:43] [INFO ] Deduced a trap composed of 432 places in 440 ms of which 1 ms to minimize.
[2023-03-24 06:51:44] [INFO ] Deduced a trap composed of 456 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:51:45] [INFO ] Deduced a trap composed of 438 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:51:45] [INFO ] Deduced a trap composed of 446 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:51:46] [INFO ] Deduced a trap composed of 446 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:51:46] [INFO ] Deduced a trap composed of 436 places in 475 ms of which 1 ms to minimize.
[2023-03-24 06:51:47] [INFO ] Deduced a trap composed of 444 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:51:48] [INFO ] Deduced a trap composed of 446 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:51:49] [INFO ] Deduced a trap composed of 446 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:51:49] [INFO ] Deduced a trap composed of 436 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:51:50] [INFO ] Deduced a trap composed of 436 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:51:51] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:51:51] [INFO ] Deduced a trap composed of 432 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:51:52] [INFO ] Deduced a trap composed of 456 places in 440 ms of which 1 ms to minimize.
[2023-03-24 06:51:52] [INFO ] Deduced a trap composed of 450 places in 484 ms of which 0 ms to minimize.
[2023-03-24 06:51:53] [INFO ] Deduced a trap composed of 438 places in 472 ms of which 1 ms to minimize.
[2023-03-24 06:51:53] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:51:54] [INFO ] Deduced a trap composed of 448 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:51:55] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:51:55] [INFO ] Deduced a trap composed of 430 places in 450 ms of which 1 ms to minimize.
[2023-03-24 06:51:56] [INFO ] Deduced a trap composed of 440 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:51:56] [INFO ] Deduced a trap composed of 438 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:51:57] [INFO ] Deduced a trap composed of 440 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:51:57] [INFO ] Deduced a trap composed of 434 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:51:58] [INFO ] Deduced a trap composed of 440 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:51:59] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:52:00] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 0 ms to minimize.
[2023-03-24 06:52:00] [INFO ] Deduced a trap composed of 440 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:52:01] [INFO ] Deduced a trap composed of 440 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:52:03] [INFO ] Deduced a trap composed of 432 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:52:04] [INFO ] Deduced a trap composed of 442 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:52:05] [INFO ] Deduced a trap composed of 444 places in 428 ms of which 1 ms to minimize.
[2023-03-24 06:52:05] [INFO ] Deduced a trap composed of 444 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:52:06] [INFO ] Deduced a trap composed of 448 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:52:06] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:52:09] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 38936 ms
[2023-03-24 06:52:09] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-24 06:52:09] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 06:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:52:10] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-24 06:52:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:52:10] [INFO ] [Nat]Absence check using 135 positive place invariants in 62 ms returned sat
[2023-03-24 06:52:10] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-24 06:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:52:10] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2023-03-24 06:52:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 634 ms returned sat
[2023-03-24 06:52:12] [INFO ] Deduced a trap composed of 442 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:52:12] [INFO ] Deduced a trap composed of 434 places in 487 ms of which 1 ms to minimize.
[2023-03-24 06:52:13] [INFO ] Deduced a trap composed of 438 places in 462 ms of which 1 ms to minimize.
[2023-03-24 06:52:13] [INFO ] Deduced a trap composed of 434 places in 446 ms of which 0 ms to minimize.
[2023-03-24 06:52:14] [INFO ] Deduced a trap composed of 438 places in 497 ms of which 1 ms to minimize.
[2023-03-24 06:52:14] [INFO ] Deduced a trap composed of 436 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:52:15] [INFO ] Deduced a trap composed of 444 places in 488 ms of which 1 ms to minimize.
[2023-03-24 06:52:15] [INFO ] Deduced a trap composed of 436 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:52:16] [INFO ] Deduced a trap composed of 450 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:52:17] [INFO ] Deduced a trap composed of 438 places in 470 ms of which 1 ms to minimize.
[2023-03-24 06:52:17] [INFO ] Deduced a trap composed of 444 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:52:18] [INFO ] Deduced a trap composed of 438 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:52:18] [INFO ] Deduced a trap composed of 448 places in 456 ms of which 1 ms to minimize.
[2023-03-24 06:52:19] [INFO ] Deduced a trap composed of 450 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:52:19] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:52:20] [INFO ] Deduced a trap composed of 440 places in 480 ms of which 1 ms to minimize.
[2023-03-24 06:52:21] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 0 ms to minimize.
[2023-03-24 06:52:21] [INFO ] Deduced a trap composed of 436 places in 440 ms of which 9 ms to minimize.
[2023-03-24 06:52:22] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:52:22] [INFO ] Deduced a trap composed of 442 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:52:23] [INFO ] Deduced a trap composed of 446 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:52:24] [INFO ] Deduced a trap composed of 446 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:52:24] [INFO ] Deduced a trap composed of 448 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:52:25] [INFO ] Deduced a trap composed of 448 places in 467 ms of which 0 ms to minimize.
[2023-03-24 06:52:25] [INFO ] Deduced a trap composed of 450 places in 469 ms of which 1 ms to minimize.
[2023-03-24 06:52:26] [INFO ] Deduced a trap composed of 460 places in 448 ms of which 0 ms to minimize.
[2023-03-24 06:52:27] [INFO ] Deduced a trap composed of 442 places in 456 ms of which 1 ms to minimize.
[2023-03-24 06:52:27] [INFO ] Deduced a trap composed of 430 places in 429 ms of which 1 ms to minimize.
[2023-03-24 06:52:28] [INFO ] Deduced a trap composed of 436 places in 480 ms of which 1 ms to minimize.
[2023-03-24 06:52:28] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:52:29] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 5 ms to minimize.
[2023-03-24 06:52:29] [INFO ] Deduced a trap composed of 444 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:52:30] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:52:31] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:52:32] [INFO ] Deduced a trap composed of 442 places in 441 ms of which 2 ms to minimize.
[2023-03-24 06:52:33] [INFO ] Deduced a trap composed of 440 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:52:33] [INFO ] Deduced a trap composed of 438 places in 456 ms of which 1 ms to minimize.
[2023-03-24 06:52:34] [INFO ] Deduced a trap composed of 446 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:52:35] [INFO ] Deduced a trap composed of 448 places in 473 ms of which 1 ms to minimize.
[2023-03-24 06:52:36] [INFO ] Deduced a trap composed of 442 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:52:36] [INFO ] Deduced a trap composed of 446 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:52:37] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 2 ms to minimize.
[2023-03-24 06:52:38] [INFO ] Deduced a trap composed of 438 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:52:40] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:52:42] [INFO ] Deduced a trap composed of 434 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:52:43] [INFO ] Deduced a trap composed of 446 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:52:43] [INFO ] Deduced a trap composed of 444 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:52:44] [INFO ] Deduced a trap composed of 436 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:52:45] [INFO ] Deduced a trap composed of 430 places in 435 ms of which 0 ms to minimize.
[2023-03-24 06:52:45] [INFO ] Deduced a trap composed of 428 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:52:46] [INFO ] Deduced a trap composed of 456 places in 485 ms of which 1 ms to minimize.
[2023-03-24 06:52:48] [INFO ] Deduced a trap composed of 432 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:52:49] [INFO ] Deduced a trap composed of 452 places in 492 ms of which 1 ms to minimize.
[2023-03-24 06:52:49] [INFO ] Deduced a trap composed of 448 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:52:50] [INFO ] Deduced a trap composed of 434 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:52:51] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-24 06:52:52] [INFO ] Deduced a trap composed of 434 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:52:53] [INFO ] Deduced a trap composed of 444 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:52:54] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:52:55] [INFO ] Deduced a trap composed of 7 places in 644 ms of which 1 ms to minimize.
[2023-03-24 06:52:55] [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.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: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)
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 74 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 74 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-24 06:52:56] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:52:56] [INFO ] Invariant cache hit.
[2023-03-24 06:52:57] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2023-03-24 06:52:57] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:52:57] [INFO ] Invariant cache hit.
[2023-03-24 06:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:03] [INFO ] Implicit Places using invariants and state equation in 6321 ms returned []
Implicit Place search using SMT with State Equation took 7416 ms to find 0 implicit places.
[2023-03-24 06:53:03] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-24 06:53:03] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:53:03] [INFO ] Invariant cache hit.
[2023-03-24 06:53:04] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8726 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-24 06:53:04] [INFO ] Computed 142 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 719 resets, run finished after 96 ms. (steps per millisecond=104 ) 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-24 06:53:04] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-24 06:53:05] [INFO ] Computed 142 place invariants in 52 ms
[2023-03-24 06:53:05] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-24 06:53:05] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 06:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:05] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-24 06:53:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:05] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 06:53:05] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-24 06:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:06] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2023-03-24 06:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 947 ms returned sat
[2023-03-24 06:53:07] [INFO ] Deduced a trap composed of 444 places in 431 ms of which 1 ms to minimize.
[2023-03-24 06:53:08] [INFO ] Deduced a trap composed of 450 places in 496 ms of which 0 ms to minimize.
[2023-03-24 06:53:08] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:53:09] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:53:09] [INFO ] Deduced a trap composed of 454 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:53:10] [INFO ] Deduced a trap composed of 452 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:53:10] [INFO ] Deduced a trap composed of 438 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:53:10] [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 51 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-24 06:53:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:53:10] [INFO ] Invariant cache hit.
[2023-03-24 06:53:12] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1302 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-24 06:53:12] [INFO ] Computed 142 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 70284 resets, run finished after 9396 ms. (steps per millisecond=106 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7164 resets, run finished after 1865 ms. (steps per millisecond=536 ) properties (out of 1) seen :3
[2023-03-24 06:53:23] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-24 06:53:23] [INFO ] Computed 142 place invariants in 39 ms
[2023-03-24 06:53:23] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-24 06:53:23] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 06:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:24] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-24 06:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:53:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-24 06:53:24] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 06:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:53:24] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-24 06:53:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:53:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 947 ms returned sat
[2023-03-24 06:53:26] [INFO ] Deduced a trap composed of 444 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:53:26] [INFO ] Deduced a trap composed of 450 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:53:27] [INFO ] Deduced a trap composed of 438 places in 483 ms of which 1 ms to minimize.
[2023-03-24 06:53:27] [INFO ] Deduced a trap composed of 442 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:53:28] [INFO ] Deduced a trap composed of 454 places in 477 ms of which 1 ms to minimize.
[2023-03-24 06:53:29] [INFO ] Deduced a trap composed of 452 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:53:29] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:53:30] [INFO ] Deduced a trap composed of 442 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:53:30] [INFO ] Deduced a trap composed of 444 places in 457 ms of which 0 ms to minimize.
[2023-03-24 06:53:31] [INFO ] Deduced a trap composed of 454 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:53:31] [INFO ] Deduced a trap composed of 438 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:53:32] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2023-03-24 06:53:32] [INFO ] Deduced a trap composed of 442 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:53:33] [INFO ] Deduced a trap composed of 452 places in 477 ms of which 1 ms to minimize.
[2023-03-24 06:53:33] [INFO ] Deduced a trap composed of 436 places in 474 ms of which 0 ms to minimize.
[2023-03-24 06:53:34] [INFO ] Deduced a trap composed of 436 places in 468 ms of which 1 ms to minimize.
[2023-03-24 06:53:35] [INFO ] Deduced a trap composed of 446 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:53:35] [INFO ] Deduced a trap composed of 454 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:53:36] [INFO ] Deduced a trap composed of 452 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:53:36] [INFO ] Deduced a trap composed of 434 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:53:37] [INFO ] Deduced a trap composed of 448 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:53:37] [INFO ] Deduced a trap composed of 442 places in 484 ms of which 1 ms to minimize.
[2023-03-24 06:53:39] [INFO ] Deduced a trap composed of 432 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:53:39] [INFO ] Deduced a trap composed of 456 places in 460 ms of which 1 ms to minimize.
[2023-03-24 06:53:40] [INFO ] Deduced a trap composed of 438 places in 440 ms of which 1 ms to minimize.
[2023-03-24 06:53:40] [INFO ] Deduced a trap composed of 446 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:53:41] [INFO ] Deduced a trap composed of 446 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:53:42] [INFO ] Deduced a trap composed of 436 places in 485 ms of which 1 ms to minimize.
[2023-03-24 06:53:42] [INFO ] Deduced a trap composed of 444 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:53:43] [INFO ] Deduced a trap composed of 446 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:53:44] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 1 ms to minimize.
[2023-03-24 06:53:44] [INFO ] Deduced a trap composed of 436 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:53:46] [INFO ] Deduced a trap composed of 436 places in 454 ms of which 0 ms to minimize.
[2023-03-24 06:53:46] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:53:47] [INFO ] Deduced a trap composed of 432 places in 460 ms of which 0 ms to minimize.
[2023-03-24 06:53:47] [INFO ] Deduced a trap composed of 456 places in 466 ms of which 1 ms to minimize.
[2023-03-24 06:53:48] [INFO ] Deduced a trap composed of 450 places in 443 ms of which 1 ms to minimize.
[2023-03-24 06:53:48] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:53:49] [INFO ] Deduced a trap composed of 442 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:53:49] [INFO ] Deduced a trap composed of 448 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:53:50] [INFO ] Deduced a trap composed of 444 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:53:50] [INFO ] Deduced a trap composed of 430 places in 437 ms of which 1 ms to minimize.
[2023-03-24 06:53:51] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:53:52] [INFO ] Deduced a trap composed of 438 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:53:52] [INFO ] Deduced a trap composed of 440 places in 467 ms of which 1 ms to minimize.
[2023-03-24 06:53:53] [INFO ] Deduced a trap composed of 434 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:53:54] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:53:54] [INFO ] Deduced a trap composed of 444 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:53:55] [INFO ] Deduced a trap composed of 440 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:53:55] [INFO ] Deduced a trap composed of 440 places in 453 ms of which 0 ms to minimize.
[2023-03-24 06:53:56] [INFO ] Deduced a trap composed of 440 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:53:58] [INFO ] Deduced a trap composed of 432 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:53:59] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-24 06:54:00] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 0 ms to minimize.
[2023-03-24 06:54:00] [INFO ] Deduced a trap composed of 444 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:54:01] [INFO ] Deduced a trap composed of 448 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:54:01] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:54:04] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 38980 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 46 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 46 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 83 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-24 06:54:05] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:54:05] [INFO ] Invariant cache hit.
[2023-03-24 06:54:05] [INFO ] Implicit Places using invariants in 932 ms returned []
[2023-03-24 06:54:05] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:54:05] [INFO ] Invariant cache hit.
[2023-03-24 06:54:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:54:14] [INFO ] Implicit Places using invariants and state equation in 8188 ms returned []
Implicit Place search using SMT with State Equation took 9134 ms to find 0 implicit places.
[2023-03-24 06:54:14] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-24 06:54:14] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:54:14] [INFO ] Invariant cache hit.
[2023-03-24 06:54:15] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10468 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00 in 70615 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-24 06:54:15] [INFO ] Computed 142 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 712 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-24 06:54:15] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-24 06:54:15] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-24 06:54:15] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 06:54:15] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-24 06:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:16] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-24 06:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:54:16] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-24 06:54:16] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-24 06:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:16] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-24 06:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:54:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 638 ms returned sat
[2023-03-24 06:54:18] [INFO ] Deduced a trap composed of 442 places in 477 ms of which 1 ms to minimize.
[2023-03-24 06:54:18] [INFO ] Deduced a trap composed of 434 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:54:19] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:54:19] [INFO ] Deduced a trap composed of 434 places in 480 ms of which 1 ms to minimize.
[2023-03-24 06:54:20] [INFO ] Deduced a trap composed of 438 places in 473 ms of which 1 ms to minimize.
[2023-03-24 06:54:20] [INFO ] Deduced a trap composed of 436 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:54:21] [INFO ] Deduced a trap composed of 444 places in 449 ms of which 1 ms to minimize.
[2023-03-24 06:54:22] [INFO ] Deduced a trap composed of 7 places in 638 ms of which 1 ms to minimize.
[2023-03-24 06:54:22] [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 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-24 06:54:22] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:54:22] [INFO ] Invariant cache hit.
[2023-03-24 06:54:23] [INFO ] Dead Transitions using invariants and state equation in 1190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1264 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-24 06:54:23] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70414 resets, run finished after 9398 ms. (steps per millisecond=106 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7156 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties (out of 1) seen :3
[2023-03-24 06:54:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-24 06:54:34] [INFO ] Computed 142 place invariants in 40 ms
[2023-03-24 06:54:34] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2023-03-24 06:54:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-24 06:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:35] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-24 06:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 06:54:35] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-24 06:54:35] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-24 06:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 06:54:35] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2023-03-24 06:54:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:54:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 652 ms returned sat
[2023-03-24 06:54:37] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:54:37] [INFO ] Deduced a trap composed of 434 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:54:38] [INFO ] Deduced a trap composed of 438 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:54:38] [INFO ] Deduced a trap composed of 434 places in 452 ms of which 1 ms to minimize.
[2023-03-24 06:54:39] [INFO ] Deduced a trap composed of 438 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:54:39] [INFO ] Deduced a trap composed of 436 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:54:40] [INFO ] Deduced a trap composed of 444 places in 458 ms of which 1 ms to minimize.
[2023-03-24 06:54:40] [INFO ] Deduced a trap composed of 436 places in 435 ms of which 0 ms to minimize.
[2023-03-24 06:54:41] [INFO ] Deduced a trap composed of 450 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:54:41] [INFO ] Deduced a trap composed of 438 places in 453 ms of which 0 ms to minimize.
[2023-03-24 06:54:42] [INFO ] Deduced a trap composed of 444 places in 463 ms of which 1 ms to minimize.
[2023-03-24 06:54:43] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-24 06:54:43] [INFO ] Deduced a trap composed of 448 places in 460 ms of which 1 ms to minimize.
[2023-03-24 06:54:44] [INFO ] Deduced a trap composed of 450 places in 475 ms of which 1 ms to minimize.
[2023-03-24 06:54:44] [INFO ] Deduced a trap composed of 442 places in 495 ms of which 1 ms to minimize.
[2023-03-24 06:54:45] [INFO ] Deduced a trap composed of 440 places in 473 ms of which 1 ms to minimize.
[2023-03-24 06:54:45] [INFO ] Deduced a trap composed of 450 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:54:46] [INFO ] Deduced a trap composed of 436 places in 459 ms of which 1 ms to minimize.
[2023-03-24 06:54:47] [INFO ] Deduced a trap composed of 442 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:54:47] [INFO ] Deduced a trap composed of 442 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:54:48] [INFO ] Deduced a trap composed of 446 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:54:48] [INFO ] Deduced a trap composed of 446 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:54:49] [INFO ] Deduced a trap composed of 448 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:54:50] [INFO ] Deduced a trap composed of 448 places in 445 ms of which 1 ms to minimize.
[2023-03-24 06:54:50] [INFO ] Deduced a trap composed of 450 places in 447 ms of which 0 ms to minimize.
[2023-03-24 06:54:51] [INFO ] Deduced a trap composed of 460 places in 457 ms of which 1 ms to minimize.
[2023-03-24 06:54:51] [INFO ] Deduced a trap composed of 442 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:54:52] [INFO ] Deduced a trap composed of 430 places in 456 ms of which 1 ms to minimize.
[2023-03-24 06:54:52] [INFO ] Deduced a trap composed of 436 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:54:53] [INFO ] Deduced a trap composed of 446 places in 477 ms of which 1 ms to minimize.
[2023-03-24 06:54:54] [INFO ] Deduced a trap composed of 438 places in 480 ms of which 1 ms to minimize.
[2023-03-24 06:54:54] [INFO ] Deduced a trap composed of 444 places in 460 ms of which 0 ms to minimize.
[2023-03-24 06:54:55] [INFO ] Deduced a trap composed of 438 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:54:56] [INFO ] Deduced a trap composed of 442 places in 435 ms of which 1 ms to minimize.
[2023-03-24 06:54:57] [INFO ] Deduced a trap composed of 442 places in 457 ms of which 0 ms to minimize.
[2023-03-24 06:54:58] [INFO ] Deduced a trap composed of 440 places in 439 ms of which 1 ms to minimize.
[2023-03-24 06:54:58] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-24 06:54:59] [INFO ] Deduced a trap composed of 446 places in 441 ms of which 1 ms to minimize.
[2023-03-24 06:55:00] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 1 ms to minimize.
[2023-03-24 06:55:00] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-24 06:55:01] [INFO ] Deduced a trap composed of 446 places in 502 ms of which 0 ms to minimize.
[2023-03-24 06:55:02] [INFO ] Deduced a trap composed of 438 places in 492 ms of which 1 ms to minimize.
[2023-03-24 06:55:04] [INFO ] Deduced a trap composed of 438 places in 476 ms of which 1 ms to minimize.
[2023-03-24 06:55:05] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 1 ms to minimize.
[2023-03-24 06:55:07] [INFO ] Deduced a trap composed of 434 places in 438 ms of which 1 ms to minimize.
[2023-03-24 06:55:08] [INFO ] Deduced a trap composed of 446 places in 465 ms of which 1 ms to minimize.
[2023-03-24 06:55:08] [INFO ] Deduced a trap composed of 444 places in 446 ms of which 1 ms to minimize.
[2023-03-24 06:55:09] [INFO ] Deduced a trap composed of 436 places in 488 ms of which 1 ms to minimize.
[2023-03-24 06:55:10] [INFO ] Deduced a trap composed of 430 places in 454 ms of which 1 ms to minimize.
[2023-03-24 06:55:10] [INFO ] Deduced a trap composed of 428 places in 489 ms of which 1 ms to minimize.
[2023-03-24 06:55:11] [INFO ] Deduced a trap composed of 456 places in 434 ms of which 1 ms to minimize.
[2023-03-24 06:55:13] [INFO ] Deduced a trap composed of 432 places in 447 ms of which 1 ms to minimize.
[2023-03-24 06:55:14] [INFO ] Deduced a trap composed of 452 places in 442 ms of which 1 ms to minimize.
[2023-03-24 06:55:14] [INFO ] Deduced a trap composed of 448 places in 506 ms of which 0 ms to minimize.
[2023-03-24 06:55:15] [INFO ] Deduced a trap composed of 434 places in 444 ms of which 1 ms to minimize.
[2023-03-24 06:55:16] [INFO ] Deduced a trap composed of 440 places in 549 ms of which 1 ms to minimize.
[2023-03-24 06:55:17] [INFO ] Deduced a trap composed of 434 places in 471 ms of which 1 ms to minimize.
[2023-03-24 06:55:18] [INFO ] Deduced a trap composed of 444 places in 453 ms of which 1 ms to minimize.
[2023-03-24 06:55:19] [INFO ] Deduced a trap composed of 442 places in 471 ms of which 1 ms to minimize.
[2023-03-24 06:55:20] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 43713 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 43 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 43 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 71 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-24 06:55:20] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:55:20] [INFO ] Invariant cache hit.
[2023-03-24 06:55:21] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-24 06:55:21] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:55:21] [INFO ] Invariant cache hit.
[2023-03-24 06:55:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:55:27] [INFO ] Implicit Places using invariants and state equation in 6155 ms returned []
Implicit Place search using SMT with State Equation took 7131 ms to find 0 implicit places.
[2023-03-24 06:55:27] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-24 06:55:27] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-24 06:55:27] [INFO ] Invariant cache hit.
[2023-03-24 06:55:28] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8409 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04 in 73388 ms.
[2023-03-24 06:55:29] [INFO ] Flatten gal took : 278 ms
[2023-03-24 06:55:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-24 06:55:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 2062 transitions and 11821 arcs took 14 ms.
Total runtime 450729 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PolyORBNT_COL_S10J60_unf
(NrP: 1091 NrTr: 2062 NrArc: 11821)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.277sec
net check time: 0m 0.001sec
init dd package: 0m 2.716sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10551292 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095932 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.015sec
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="marciexred"
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 marciexred"
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 r298-tall-167873952100701"
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 ;