About the Execution of GreatSPN+red for JoinFreeModules-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8937.764 | 3436724.00 | 5577581.00 | 7051.20 | FTTFT?FFFFFFFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610600060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 613K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716500096188
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:34:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 21:34:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:34:57] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-23 21:34:57] [INFO ] Transformed 1001 places.
[2024-05-23 21:34:57] [INFO ] Transformed 1601 transitions.
[2024-05-23 21:34:57] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 85 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2024-05-23 21:34:58] [INFO ] Computed 200 invariants in 35 ms
[2024-05-23 21:34:58] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 timeout
4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20482ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20515ms
[2024-05-23 21:35:18] [INFO ] Invariant cache hit.
[2024-05-23 21:35:19] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-23 21:35:19] [INFO ] Invariant cache hit.
[2024-05-23 21:35:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:35:19] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:35:19] [INFO ] Invariant cache hit.
[2024-05-23 21:35:19] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60568ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Finished structural reductions in LTL mode , in 1 iterations and 82661 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 29 out of 1000 places after structural reductions.
[2024-05-23 21:36:20] [INFO ] Flatten gal took : 118 ms
[2024-05-23 21:36:20] [INFO ] Flatten gal took : 63 ms
[2024-05-23 21:36:20] [INFO ] Input system was already deterministic with 1601 transitions.
Support contains 28 out of 1000 places (down from 29) after GAL structural reductions.
RANDOM walk for 40539 steps (8 resets) in 713 ms. (56 steps per ms) remains 17/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
[2024-05-23 21:36:21] [INFO ] Invariant cache hit.
[2024-05-23 21:36:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 76/95 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 8 ms to minimize.
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:36:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 152/247 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 19/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/2601 variables, and 139 constraints, problems are : Problem set: 0 solved, 16 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 19/200 constraints, State Equation: 95/1000 constraints, ReadFeed: 19/200 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 76/95 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-23 21:36:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:36:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:36:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 152/247 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 19/142 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 16/158 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/2601 variables, and 158 constraints, problems are : Problem set: 0 solved, 16 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 19/200 constraints, State Equation: 95/1000 constraints, ReadFeed: 19/200 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 1413ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 6 different solutions.
Finished Parikh walk after 2119 steps, including 0 resets, run visited all 16 properties in 75 ms. (steps per millisecond=28 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 16 properties in 90 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:36:23] [INFO ] Invariant cache hit.
[2024-05-23 21:36:23] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20381ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20391ms
[2024-05-23 21:36:43] [INFO ] Invariant cache hit.
[2024-05-23 21:36:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-23 21:36:44] [INFO ] Invariant cache hit.
[2024-05-23 21:36:44] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:36:44] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:36:44] [INFO ] Invariant cache hit.
[2024-05-23 21:36:44] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in LTL mode , in 1 iterations and 81513 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-00 finished in 81805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:37:45] [INFO ] Invariant cache hit.
[2024-05-23 21:37:45] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20282ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20292ms
[2024-05-23 21:38:05] [INFO ] Invariant cache hit.
[2024-05-23 21:38:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-23 21:38:05] [INFO ] Invariant cache hit.
[2024-05-23 21:38:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:38:06] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:38:06] [INFO ] Invariant cache hit.
[2024-05-23 21:38:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Finished structural reductions in LTL mode , in 1 iterations and 81354 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 3122 ms.
Product exploration explored 100000 steps with 33333 reset in 3267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-01 finished in 89593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||X(F((p0&&X(F(p1)))))))) U (p2||G(p3))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 78 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:39:14] [INFO ] Invariant cache hit.
[2024-05-23 21:39:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20263ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20274ms
[2024-05-23 21:39:35] [INFO ] Invariant cache hit.
[2024-05-23 21:39:35] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 21:39:35] [INFO ] Invariant cache hit.
[2024-05-23 21:39:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:39:35] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-23 21:39:36] [INFO ] Redundant transitions in 84 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:39:36] [INFO ] Invariant cache hit.
[2024-05-23 21:39:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81482 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-03 finished in 81784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:40:36] [INFO ] Invariant cache hit.
[2024-05-23 21:40:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20259ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20270ms
[2024-05-23 21:40:56] [INFO ] Invariant cache hit.
[2024-05-23 21:40:57] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-23 21:40:57] [INFO ] Invariant cache hit.
[2024-05-23 21:40:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:40:57] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:40:57] [INFO ] Invariant cache hit.
[2024-05-23 21:40:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 0.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 187.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 192.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 191.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 192.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 191.0)
(s39 5.0)
(s40 5.0)
(s41 189.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 192.0)
(s50 5.0)
(s51 2.0)
(s52 187.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 4.0)
(s59 192.0)
(s60 192.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 187.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s72 187.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 0.0)
(s78 191.0)
(s79 5.0)
(s80 192.0)
(s81 2.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 187.0)
(s88 4.0)
(s89 5.0)
(s90 192.0)
(s91 2.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 192.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 192.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 189.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 187.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 4.0)
(s119 192.0)
(s120 5.0)
(s121 2.0)
(s122 187.0)
(s123 4.0)
(s124 5.0)
(s125 192.0)
(s126 2.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s132 0.0)
(s133 191.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s137 0.0)
(s138 4.0)
(s139 192.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 192.0)
(s145 5.0)
(s146 2.0)
(s147 187.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 189.0)
(s152 0.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 189.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 192.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 5.0)
(s165 192.0)
(s166 2.0)
(s167 0.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 0.0)
(s173 191.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 191.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 191.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 0.0)
(s188 191.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 191.0)
(s194 5.0)
(s195 5.0)
(s196 189.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 192.0)
(s201 2.0)
(s202 0.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 189.0)
(s207 0.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 187.0)
(s213 4.0)
(s214 5.0)
(s215 192.0)
(s216 2.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 189.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s227 187.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 189.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 189.0)
(s237 0.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 191.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s247 187.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 192.0)
(s255 5.0)
(s256 189.0)
(s257 0.0)
(s258 4.0)
(s259 5.0)
(s260 192.0)
(s261 2.0)
(s262 0.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 187.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 0.0)
(s273 191.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 191.0)
(s279 5.0)
(s280 192.0)
(s281 2.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 187.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s292 187.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 187.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s302 187.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 timeout
2.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in LTL mode , in 1 iterations and 81287 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05
Product exploration timeout after 90350 steps with 0 reset in 10001 ms.
Product exploration timeout after 85410 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 33906 steps (7 resets) in 427 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:42:20] [INFO ] Invariant cache hit.
[2024-05-23 21:42:20] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20270ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20280ms
[2024-05-23 21:42:40] [INFO ] Invariant cache hit.
[2024-05-23 21:42:40] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-23 21:42:40] [INFO ] Invariant cache hit.
[2024-05-23 21:42:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:42:41] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:42:41] [INFO ] Invariant cache hit.
[2024-05-23 21:42:41] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in LTL mode , in 1 iterations and 81314 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40290 steps (8 resets) in 507 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 185413 steps, run timeout after 3112 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 185413 steps, saw 184680 distinct states, run finished after 3119 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 21:43:47] [INFO ] Invariant cache hit.
[2024-05-23 21:43:47] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/2601 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/200 constraints, State Equation: 5/1000 constraints, ReadFeed: 1/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 21:43:47] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/2601 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/200 constraints, State Equation: 5/1000 constraints, ReadFeed: 1/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 87840 steps with 0 reset in 10001 ms.
Product exploration timeout after 84260 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 97 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:44:08] [INFO ] Invariant cache hit.
[2024-05-23 21:44:08] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20272ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20294ms
[2024-05-23 21:44:28] [INFO ] Redundant transitions in 62 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:44:28] [INFO ] Invariant cache hit.
[2024-05-23 21:44:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80769 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:45:29] [INFO ] Invariant cache hit.
[2024-05-23 21:45:29] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20267ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20276ms
[2024-05-23 21:45:49] [INFO ] Invariant cache hit.
[2024-05-23 21:45:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 21:45:49] [INFO ] Invariant cache hit.
[2024-05-23 21:45:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:45:50] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:45:50] [INFO ] Invariant cache hit.
[2024-05-23 21:45:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 timeout
189.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in LTL mode , in 1 iterations and 81353 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 373999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:46:50] [INFO ] Invariant cache hit.
[2024-05-23 21:46:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20261ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20269ms
[2024-05-23 21:47:10] [INFO ] Invariant cache hit.
[2024-05-23 21:47:11] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 21:47:11] [INFO ] Invariant cache hit.
[2024-05-23 21:47:11] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:47:11] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:47:11] [INFO ] Invariant cache hit.
[2024-05-23 21:47:11] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in LTL mode , in 1 iterations and 81324 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-06 finished in 81596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p0))||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 51 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:48:12] [INFO ] Invariant cache hit.
[2024-05-23 21:48:12] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20259ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20267ms
[2024-05-23 21:48:32] [INFO ] Invariant cache hit.
[2024-05-23 21:48:32] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 21:48:32] [INFO ] Invariant cache hit.
[2024-05-23 21:48:33] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:48:33] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-23 21:48:33] [INFO ] Redundant transitions in 20 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:48:33] [INFO ] Invariant cache hit.
[2024-05-23 21:48:33] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81404 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-08
Product exploration explored 100000 steps with 20 reset in 8333 ms.
Stack based approach found an accepted trace after 39397 steps with 7 reset with depth 5899 and stack size 5898 in 3524 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-08 finished in 93384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F(p1)))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:49:45] [INFO ] Invariant cache hit.
[2024-05-23 21:49:45] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 timeout
5.0)
(s405 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20249ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20258ms
[2024-05-23 21:50:05] [INFO ] Invariant cache hit.
[2024-05-23 21:50:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-23 21:50:06] [INFO ] Invariant cache hit.
[2024-05-23 21:50:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:50:06] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:50:06] [INFO ] Invariant cache hit.
[2024-05-23 21:50:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in LTL mode , in 1 iterations and 81328 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-09
Product exploration explored 100000 steps with 50 reset in 6868 ms.
Stack based approach found an accepted trace after 7355 steps with 3 reset with depth 2861 and stack size 2861 in 511 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-09 finished in 88975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 48 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:51:14] [INFO ] Invariant cache hit.
[2024-05-23 21:51:14] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20252ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20263ms
[2024-05-23 21:51:34] [INFO ] Invariant cache hit.
[2024-05-23 21:51:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-23 21:51:35] [INFO ] Invariant cache hit.
[2024-05-23 21:51:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:51:35] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2024-05-23 21:51:35] [INFO ] Redundant transitions in 19 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:51:35] [INFO ] Invariant cache hit.
[2024-05-23 21:51:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 187)
(s298 4)
(s299 5)
(s300 5)
(s301 189)
(s302 0)
(s303 4)
(s304 5)
(s305 5)
(s306 2)
(s307 187)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 191)
(s314 5)
(s315 5)
(s316 189)
(s317 0)
(s318 4)
(s319 5)
(s320 5)
(s321 2)
(s322 0)
(s323 4)
(s324 192)
(s325 5)
(s326 2)
(s327 0)
(s328 191)
(s329 5)
(s330 5)
(s331 2)
(s332 187)
(s333 4)
(s334 5)
(s335 5)
(s336 2)
(s337 187)
(s338 4)
(s339 5)
(s340 192)
(s341 2)
(s342 0)
(s343 4)
(s344 5)
(s345 5)
(s346 2)
(s347 0)
(s348 4)
(s349 192)
(s350 192)
(s351 2)
(s352 0)
(s353 4)
(s354 5)
(s355 192)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 192)
(s361 2)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 2)
(s367 0)
(s368 191)
(s369 5)
(s370 5)
(s371 189)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 2)
(s377 0)
(s378 191)
(s379 5)
(s380 5)
(s381 2)
(s382 187)
(s383 4)
(s384 5)
(s385 5)
(s386 189)
(s387 0)
(s388 4)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 4)
(s394 192)
(s395 5)
(s396 189)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 2)
(s402 187)
(s403 4)
(s404 5)
(s405 5)
(s406 2)
(s407 187)
(s408 4)
(s409 5)
(s410 192)
(s411 2)
(s412 0)
(s413 4)
(s414 5)
(s415 5)
(s416 189)
(s417 0)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 0)
(s423 4)
(s424 192)
(s425 5)
(s426 189)
(s427 0)
(s428 4)
(s429 5)
(s430 5)
(s431 2)
(s432 0)
(s433 4)
(s434 192)
(s435 5)
(s436 2)
(s437 0)
(s438 4)
(s439 192)
(s440 5)
(s441 189)
(s442 0)
(s443 4)
(s444 5)
(s445 5)
(s446 189)
(s447 0)
(s448 4)
(s449 5)
(s450 192)
(s451 2)
(s452 0)
(s453 4)
(s454 5)
(s455 5)
(s456 2)
(s457 0)
(s458 4)
(s459 192)
(s460 5)
(s461 2)
(s462 187)
(s463 4)
(s464 5)
(s465 5)
(s466 2)
(s467 0)
(s468 4)
(s469 192)
(s470 5)
(s471 2)
(s472 187)
(s473 4)
(s474 5)
(s475 5)
(s476 2)
(s477 0)
(s478 191)
(s479 5)
(s480 5)
(s481 189)
(s482 0)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 4)
(s489 192)
(s490 192)
(s491 2)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 189)
(s497 0)
(s498 4)
(s499 5)
(s500 5)
(s501 2)
(s502 0)
(s503 4)
(s504 192)
(s505 5)
(s506 2)
(s507 187)
(s508 4)
(s509 5)
(s510 192)
(s511 2)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 191)
(s519 5)
(s520 5)
(s521 2)
(s522 0)
(s523 191)
(s524 5)
(s525 5)
(s526 2)
(s527 0)
(s528 191)
(s529 5)
(s530 5)
(s531 2)
(s532 0)
(s533 191)
(s534 5)
(s535 5)
(s536 2)
(s537 0)
(s538 191)
(s539 5)
(s540 5)
(s541 189)
(s542 0)
(s543 4)
(s544 5)
(s545 5)
(s546 2)
(s547 187)
(s548 4)
(s549 5)
(s550 5)
(s551 2)
(s552 0)
(s553 191)
(s554 5)
(s555 5)
(s556 2)
(s557 187)
(s558 4)
(s559 5)
(s560 5)
(s561 2)
(s562 0)
(s563 191)
(s564 5)
(s565 5)
(s566 2)
(s567 0)
(s568 191)
(s569 5)
(s570 192)
(s571 2)
(s572 0)
(s573 4)
(s574 5)
(s575 5)
(s576 2)
(s577 0)
(s578 191)
(s579 5)
(s580 5)
(s581 189)
(s582 0)
(s583 4)
(s584 5)
(s585 5)
(s586 189)
(s587 0)
(s588 4)
(s589 5)
(s590 5)
(s591 2)
(s592 187)
(s593 4)
(s594 5)
(s595 192)
(s596 2)
(s597 0)
(s598 4)
(s599 5)
(s600 192)
(s601 2)
(s602 0)
(s603 4)
(s604 5)
(s605 5)
(s606 2)
(s607 0)
(s608 4)
(s609 192)
(s610 5)
(s611 2)
(s612 187)
(s613 4)
(s614 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81376 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-10 finished in 81446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1&&X(p2)))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:52:36] [INFO ] Invariant cache hit.
[2024-05-23 21:52:36] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20254ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20262ms
[2024-05-23 21:52:56] [INFO ] Invariant cache hit.
[2024-05-23 21:52:56] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-23 21:52:56] [INFO ] Invariant cache hit.
[2024-05-23 21:52:56] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:52:57] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:52:57] [INFO ] Invariant cache hit.
[2024-05-23 21:52:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 81342 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-11 finished in 81611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(F(p0))||F(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 49 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:53:57] [INFO ] Invariant cache hit.
[2024-05-23 21:53:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20258ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20266ms
[2024-05-23 21:54:17] [INFO ] Invariant cache hit.
[2024-05-23 21:54:18] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 21:54:18] [INFO ] Invariant cache hit.
[2024-05-23 21:54:18] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:54:18] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-05-23 21:54:18] [INFO ] Redundant transitions in 17 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:54:18] [INFO ] Invariant cache hit.
[2024-05-23 21:54:18] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81390 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-12 finished in 81557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(p1))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:55:19] [INFO ] Invariant cache hit.
[2024-05-23 21:55:19] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20278ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20287ms
[2024-05-23 21:55:39] [INFO ] Invariant cache hit.
[2024-05-23 21:55:39] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-23 21:55:39] [INFO ] Invariant cache hit.
[2024-05-23 21:55:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:55:40] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:55:40] [INFO ] Invariant cache hit.
[2024-05-23 21:55:40] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 0.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 187.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 192.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 191.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 192.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 191.0)
(s39 5.0)
(s40 5.0)
(s41 189.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 192.0)
(s50 5.0)
(s51 2.0)
(s52 187.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 4.0)
(s59 192.0)
(s60 192.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 187.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s72 187.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 0.0)
(s78 191.0)
(s79 5.0)
(s80 192.0)
(s81 2.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 187.0)
(s88 4.0)
(s89 5.0)
(s90 192.0)
(s91 2.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 192.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 192.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 189.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 187.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 4.0)
(s119 192.0)
(s120 5.0)
(s121 2.0)
(s122 187.0)
(s123 4.0)
(s124 5.0)
(s125 192.0)
(s126 2.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s132 0.0)
(s133 191.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s137 0.0)
(s138 4.0)
(s139 192.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 192.0)
(s145 5.0)
(s146 2.0)
(s147 187.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 189.0)
(s152 0.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 189.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 192.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 5.0)
(s165 192.0)
(s166 2.0)
(s167 0.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 0.0)
(s173 191.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 191.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 191.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 0.0)
(s188 191.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 191.0)
(s194 5.0)
(s195 5.0)
(s196 189.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 192.0)
(s201 2.0)
(s202 0.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 189.0)
(s207 0.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 187.0)
(s213 timeout
4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 187)
(s298 4)
(s299 5)
(s300 5)
(s301 189)
(s302 0)
(s303 4)
(s304 5)
(s305 5)
(s306 2)
(s307 187)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 191)
(s314 5)
(s315 5)
(s316 189)
(s317 0)
(s318 4)
(s319 5)
(s320 5)
(s321 2)
(s322 0)
(s323 4)
(s324 192)
(s325 5)
(s326 2)
(s327 0)
(s328 191)
(s329 5)
(s330 5)
(s331 2)
(s332 187)
(s333 4)
(s334 5)
(s335 5)
(s336 2)
(s337 187)
(s338 4)
(s339 5)
(s340 192)
(s341 2)
(s342 0)
(s343 4)
(s344 5)
(s345 5)
(s346 2)
(s347 0)
(s348 4)
(s349 192)
(s350 192)
(s351 2)
(s352 0)
(s353 4)
(s354 5)
(s355 192)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 192)
(s361 2)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 2)
(s367 0)
(s368 191)
(s369 5)
(s370 5)
(s371 189)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 2)
(s377 0)
(s378 191)
(s379 5)
(s380 5)
(s381 2)
(s382 187)
(s383 4)
(s384 5)
(s385 5)
(s386 189)
(s387 0)
(s388 4)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 4)
(s394 192)
(s395 5)
(s396 189)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 2)
(s402 187)
(s403 4)
(s404 5)
(s405 5)
(s406 2)
(s407 187)
(s408 4)
(s409 5)
(s410 192)
(s411 2)
(s412 0)
(s413 4)
(s414 5)
(s415 5)
(s416 189)
(s417 0)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 0)
(s423 4)
(s424 192)
(s425 5)
(s426 189)
(s427 0)
(s428 4)
(s429 5)
(s430 5)
(s431 2)
(s432 0)
(s433 4)
(s434 192)
(s435 5)
(s436 2)
(s437 0)
(s438 4)
(s439 192)
(s440 5)
(s441 189)
(s442 0)
(s443 4)
(s444 5)
(s445 5)
(s446 189)
(s447 0)
(s448 4)
(s449 5)
(s450 192)
(s451 2)
(s452 0)
(s453 4)
(s454 5)
(s455 5)
(s456 2)
(s457 0)
(s458 4)
(s459 192)
(s460 5)
(s461 2)
(s462 187)
(s463 4)
(s464 5)
(s465 5)
(s466 2)
(s467 0)
(s468 4)
(s469 192)
(s470 5)
(s471 2)
(s472 187)
(s473 4)
(s474 5)
(s475 5)
(s476 2)
(s477 0)
(s478 191)
(s479 5)
(s480 5)
(s481 189)
(s482 0)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 4)
(s489 192)
(s490 192)
(s491 2)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 189)
(s497 0)
(s498 4)
(s499 5)
(s500 5)
(s501 2)
(s502 0)
(s503 4)
(s504 192)
(s505 5)
(s506 2)
(s507 187)
(s508 4)
(s509 5)
(s510 192)
(s511 2)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 191)
(s519 5)
(s520 5)
(s521 2)
(s522 0)
(s523 191)
(s524 5)
(s525 timeout
5)
(s526 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Finished structural reductions in LTL mode , in 1 iterations and 81356 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLFireability-13 finished in 81547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (p1 U X(!p1))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:56:40] [INFO ] Invariant cache hit.
[2024-05-23 21:56:40] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 timeout
5.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20256ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20263ms
[2024-05-23 21:57:01] [INFO ] Invariant cache hit.
[2024-05-23 21:57:01] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-23 21:57:01] [INFO ] Invariant cache hit.
[2024-05-23 21:57:01] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:57:01] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:57:01] [INFO ] Invariant cache hit.
[2024-05-23 21:57:01] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Finished structural reductions in LTL mode , in 1 iterations and 81318 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 195 ms :[p1, (AND p0 p1), p1, true, p0]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 2668 ms.
Product exploration explored 100000 steps with 50000 reset in 2870 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLFireability-14 finished in 88696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1))) U X(G(p2))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:58:09] [INFO ] Invariant cache hit.
[2024-05-23 21:58:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20249ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20258ms
[2024-05-23 21:58:29] [INFO ] Invariant cache hit.
[2024-05-23 21:58:29] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-23 21:58:29] [INFO ] Invariant cache hit.
[2024-05-23 21:58:30] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 21:58:30] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:58:30] [INFO ] Invariant cache hit.
[2024-05-23 21:58:30] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in LTL mode , in 1 iterations and 81294 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-15
Product exploration explored 100000 steps with 33446 reset in 3147 ms.
Product exploration explored 100000 steps with 33362 reset in 3423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40366 steps (8 resets) in 460 ms. (87 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 5/5 properties
[2024-05-23 21:59:40] [INFO ] Invariant cache hit.
[2024-05-23 21:59:40] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 21:59:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:59:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/2601 variables, and 23 constraints, problems are : Problem set: 0 solved, 5 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/2601 variables, and 28 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1023 steps, including 2 resets, run visited all 5 properties in 39 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 39 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 p1))), (F p1)]
Knowledge based reduction with 17 factoid took 353 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 21:59:41] [INFO ] Invariant cache hit.
[2024-05-23 21:59:41] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s531 2.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s536 2.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s541 2.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s546 2.0)
(s548 4.0)
(s549 5.0)
(s550 5.0)
(s551 2.0)
(s553 4.0)
(s554 5.0)
(s555 5.0)
(s556 2.0)
(s558 4.0)
(s559 5.0)
(s560 5.0)
(s561 2.0)
(s563 4.0)
(s564 5.0)
(s565 5.0)
(s566 2.0)
(s568 4.0)
(s569 5.0)
(s570 5.0)
(s571 2.0)
(s573 4.0)
(s574 5.0)
(s575 5.0)
(s576 2.0)
(s578 4.0)
(s579 5.0)
(s580 5.0)
(s581 2.0)
(s583 4.0)
(s584 5.0)
(s585 5.0)
(s586 2.0)
(s588 4.0)
(s589 5.0)
(s590 5.0)
(s591 2.0)
(s593 4.0)
(s594 5.0)
(s595 5.0)
(s596 2.0)
(s598 4.0)
(s599 5.0)
(s600 5.0)
(s601 2.0)
(s603 4.0)
(s604 5.0)
(s605 5.0)
(s606 2.0)
(s608 4.0)
(s609 5.0)
(s610 5.0)
(s611 2.0)
(s613 4.0)
(s614 5.0)
(s615 5.0)
(s616 2.0)
(s618 4.0)
(s619 5.0)
(s620 5.0)
(s621 2.0)
(s623 4.0)
(s624 5.0)
(s625 5.0)
(s626 2.0)
(s628 4.0)
(s629 5.0)
(s630 5.0)
(s631 2.0)
(s633 4.0)
(s634 5.0)
(s635 5.0)
(s636 2.0)
(s638 4.0)
(s639 5.0)
(s640 5.0)
(s641 2.0)
(s643 4.0)
(s644 5.0)
(s645 5.0)
(s646 2.0)
(s648 4.0)
(s649 5.0)
(s650 5.0)
(s651 2.0)
(s653 4.0)
(s654 5.0)
(s655 5.0)
(s656 2.0)
(s658 4.0)
(s659 5.0)
(s660 5.0)
(s661 2.0)
(s663 4.0)
(s664 5.0)
(s665 5.0)
(s666 2.0)
(s668 4.0)
(s669 5.0)
(s670 5.0)
(s671 2.0)
(s673 4.0)
(s674 5.0)
(s675 5.0)
(s676 2.0)
(s678 4.0)
(s679 5.0)
(s680 5.0)
(s681 2.0)
(s683 4.0)
(s684 5.0)
(s685 5.0)
(s686timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20261ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20269ms
[2024-05-23 22:00:01] [INFO ] Invariant cache hit.
[2024-05-23 22:00:01] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-23 22:00:01] [INFO ] Invariant cache hit.
[2024-05-23 22:00:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:00:02] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:00:02] [INFO ] Invariant cache hit.
[2024-05-23 22:00:02] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Finished structural reductions in LTL mode , in 1 iterations and 81264 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 133 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40458 steps (8 resets) in 388 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 5/8 properties
[2024-05-23 22:01:05] [INFO ] Invariant cache hit.
[2024-05-23 22:01:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 22:01:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 22:01:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 22:01:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/2601 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/2601 variables, and 29 constraints, problems are : Problem set: 0 solved, 5 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 952 steps, including 2 resets, run visited all 5 properties in 26 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 27 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F p1)]
Knowledge based reduction with 17 factoid took 362 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33284 reset in 3061 ms.
Product exploration explored 100000 steps with 33278 reset in 3330 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 33 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:01:13] [INFO ] Invariant cache hit.
[2024-05-23 22:01:13] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s531 2.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s536 2.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s541 2.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s546 2.0)
(s548 4.0)
(s549 5.0)
(s550 5.0)
(s551 2.0)
(s553 4.0)
(s554 5.0)
(s555 5.0)
(s556 2.0)
(s558 4.0)
(s559 5.0)
(s560 5.0)
(s561 2.0)
(s563 4.0)
(s564 5.0)
(s565 5.0)
(s566 2.0)
(s568 4.0)
(s569 5.0)
(s570 5.0)
(s571 2.0)
(s573 4.0)
(s574 5.0)
(s575 5.0)
(s576 2.0)
(s578 4.0)
(s579 5.0)
(s580 5.0)
(s581 2.0)
(s583 4.0)
(s584 5.0)
(s585 5.0)
(s586 2.0)
(s588 4.0)
(s589 5.0)
(s590 5.0)
(s591 2.0)
(s593 4.0)
(s594 5.0)
(s595 5.0)
(s596 2.0)
(s598 4.0)
(s599 5.0)
(s600 5.0)
(s601 2.0)
(s603 4.0)
(s604 5.0)
(s605 5.0)
(s606 2.0)
(s608 4.0)
(s609 5.0)
(s610 5.0)
(s611 2.0)
(s613 4.0)
(s614 5.0)
(s615 5.0)
(s616 2.0)
(s618 4.0)
(s619 5.0)
(s620 5.0)
(s621 2.0)
(s623 4.0)
(s624 5.0)
(s625 5.0)
(s626 2.0)
(s628 4.0)
(s629 5.0)
(s630 5.0)
(s631 2.0)
(s633 4.0)
(s634 5.0)
(s635 5.0)
(s636 2.0)
(s638 4.0)
(s639 5.0)
(s640 5.0)
(s641 2.0)
(s643 4.0)
(s644 5.0)
(s645 5.0)
(s646 2.0)
(s648 4.0)
(s649 5.0)
(s650 5.0)
(s651 2.0)
(s653 4.0)
(s654 5.0)
(s655 5.0)
(s656 2.0)
(s658 4.0)
(s659 5.0)
(s660 5.0)
(s661 2.0)
(s663 4.0)
(s664 5.0)
(s665 5.0)
(s666 2.0)
(s668 4.0)
(s669 5.0)
(s670 5.0)
(s671 2.0)
(s673 4.0)
(s674 5.0)
(s675 5.0)
(s676 2.0)
(s678 4.0)
(s679 5.0)
(s680 5.0)
(s681 2.0)
(s683 4.0)
(s684 5.0)
(s685 5.0)
(s686 2.0)
(s688 4.0)
(s689 5.0)
(s690 5.0)
(s691 2.0)
(s693 4.0)
(s694 5.0)
(s695 5.0)
(s696 2.0)
(s698 4.0)
(s699 5.0)
(s700 5.0)
(s701 2.0)
(s703 4.0)
(s704 5.0)
(s705 5.0)
(s706 2.0)
(s708 4.0)
(s709 5.0)
(s710 5.0)
(s711 2.0)
(s713 4.0)
(s714 5.0)
(s715 5.0)
(s716 2.0)
(s718 4.0)
(s719 5.0)
(s720 5.0)
(s721 2.0)
(s723 4.0)
(s724 5.0)
(s725 5.0)
(s726 2.0)
(s728 4.0)
(s729 5.0)
(s730 5.0)
(s731 2.0)
(s733 4.0)
(s734 5.0)
(s735 5.0)
(s736 2.0)
(s738 4.0)
(s739 5.0)
(s740 5.0)
(s741 2.0)
(s743 4.0)
(s744 5.0)
(s745 5.0)
(s746 2.0)
(s748 4.0)
(s749 5.0)
(s750 5.0)
(s751 2.0)
(s753 4.0)
(s754 5.0)
(s755 5.0)
(s756 2.0)
(s758 4.0)
(s759 5.0)
(s760 5.0)
(s761 2.0)
(s763 4.0)
(s764 5.0)
(s765 5.0)
(s766 2.0)
(s768 4.0)
(s769 5.0)
(s770 5.0)
(s771 2.0)
(s773 4.0)
(s774 5.0)
(s775 5.0)
(s776 2.0)
(s778 4.0)
(s779 5.0)
(s780 5.0)
(s781 2.0)
(s783 4.0)
(s784 5.0)
(s785 5.0)
(s786 2.0)
(s788 4.0)
(s789 5.0)
(s790 5.0)
(s791 2.0)
(s793 4.0)
(s794 5.0)
(s795 5.0)
(s796 2.0)
(s798 4.0)
(s799 5.0)
(s800 5.0)
(s801 2.0)
(s803 4.0)
(s804 5.0)
(s805 5.0)
(s806 2.0)
(s808 4.0)
(s809 5.0)
(s810 5.0)
(s811 2.0)
(s813 4.0)
(s814 5.0)
(s815 5.0)
(s816 2.0)
(s818 4.0)
(s819 5.0)
(s820 5.0)
(s821 2.0)
(s823 4.0)
(s824 5.0)
(s825 5.0)
(s826 2.0)
(s828 4.0)
(s829 5.0)
(s830 5.0)
(s831 2.0)
(s833 4.0)
(s834 5.0)
(s835 5.0)
(s836 2.0)
(s838 4.0)
(s839 5.0)
(s840 5.0)
(s841 2.0)
(s843 4.0)
(s844 5.0)
(s845 5.0)
(s846 2.0)
(s848 4.0)
(s849 5.0)
(s850 5.0)
(s851 2.0)
(s853 4.0)
(s854 5.0)
(s855 5.0)
(s856 2.0)
(s858 4.0)
(s859 5.0)
(s860 5.0)
(s861 2.0)
(s863 4.0)
(s864 5.0)
(s865 5.0)
(s866 2.0)
(s868 4.0)
(s869 5.0)
(s870 5.0)
(s871 2.0)
(s873 4.0)
(s874 5.0)
(s875 5.0)
(s876 2.0)
(s878 4.0)
(s879 5.0)
(s880 5.0)
(s881 2.0)
(s883 4.0)
(s884 5.0)
(s885 5.0)
(s886 2.0)
(s888 4.0)
(s889 5.0)
(s890 5.0)
(s891 2.0)
(s893 4.0)
(s894 5.0)
(s895 5.0)
(s896 2.0)
(s898 4.0)
(s899 5.0)
(s900 5.0)
(s901 2.0)
(s903 4.0)
(s904 5.0)
(s905 5.0)
(s906 2.0)
(s908 4.0)
(s909 5.0)
(s910 5.0)
(s911 2.0)
(s913 4.0)
(s914 5.0)
(s915 5.0)
(s916 2.0)
(s918 4.0)
(s919 5.0)
(s920 5.0)
(s921 2.0)
(s923 4.0)
(s924 5.0)
(s925 5.0)
(s926 2.0)
(s928 4.0)
(s929 5.0)
(s930 5.0)
(s931 2.0)
(s933 4.0)
(s934 5.0)
(s935 5.0)
(s936 2.0)
(s938 4.0)
(s939 5.0)
(s940 5.0)
(s941 2.0)
(s943 4.0)
(s944 5.0)
(s945 5.0)
(s946 2.0)
(s948 4.0)
(s949 5.0)
(s950 5.0)
(s951 2.0)
(s953 4.0)
(s954 5.0)
(s955 5.0)
(s956 2.0)
(s958 4.0)
(s959 5.0)
(s960 5.0)
(s961 2.0)
(s963 4.0)
(s964 5.0)
(s965 5.0)
(s966 2.0)
(s968 4.0)
(s969 5.0)
(s970 5.0)
(s971 2.0)
(s973 4.0)
(s974 5.0)
(s975 5.0)
(s976 2.0)
(s978 4.0)
(s979 5.0)
(s980 5.0)
(s981 2.0)
(s983 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20234ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20243ms
[2024-05-23 22:01:33] [INFO ] Redundant transitions in 17 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:01:33] [INFO ] Invariant cache hit.
[2024-05-23 22:01:33] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80584 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:02:34] [INFO ] Invariant cache hit.
[2024-05-23 22:02:34] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20248ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20258ms
[2024-05-23 22:02:54] [INFO ] Invariant cache hit.
[2024-05-23 22:02:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-23 22:02:54] [INFO ] Invariant cache hit.
[2024-05-23 22:02:55] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:02:55] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:02:55] [INFO ] Invariant cache hit.
[2024-05-23 22:02:55] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in LTL mode , in 1 iterations and 81257 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-15 finished in 346028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0200-LTLFireability-05
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 35 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:03:55] [INFO ] Invariant cache hit.
[2024-05-23 22:03:55] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20233ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20241ms
[2024-05-23 22:04:15] [INFO ] Invariant cache hit.
[2024-05-23 22:04:16] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-23 22:04:16] [INFO ] Invariant cache hit.
[2024-05-23 22:04:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:04:16] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:04:16] [INFO ] Invariant cache hit.
[2024-05-23 22:04:16] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 81285 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-05
Product exploration timeout after 89500 steps with 0 reset in 10001 ms.
Product exploration timeout after 84690 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31304 steps (6 resets) in 304 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:05:39] [INFO ] Invariant cache hit.
[2024-05-23 22:05:39] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20266ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20277ms
[2024-05-23 22:05:59] [INFO ] Invariant cache hit.
[2024-05-23 22:05:59] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-23 22:05:59] [INFO ] Invariant cache hit.
[2024-05-23 22:06:00] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:06:00] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:06:00] [INFO ] Invariant cache hit.
[2024-05-23 22:06:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in LTL mode , in 1 iterations and 81357 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 29821 steps (5 resets) in 295 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 88240 steps with 0 reset in 10001 ms.
Product exploration timeout after 85100 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 46 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:07:23] [INFO ] Invariant cache hit.
[2024-05-23 22:07:23] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20253ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20263ms
[2024-05-23 22:07:43] [INFO ] Redundant transitions in 18 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:07:43] [INFO ] Invariant cache hit.
[2024-05-23 22:07:43] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80616 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:08:43] [INFO ] Invariant cache hit.
[2024-05-23 22:08:43] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 timeout
5.0)
(s340 5.0)
(s341 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20242ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20252ms
[2024-05-23 22:09:04] [INFO ] Invariant cache hit.
[2024-05-23 22:09:04] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-23 22:09:04] [INFO ] Invariant cache hit.
[2024-05-23 22:09:04] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:09:04] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:09:04] [INFO ] Invariant cache hit.
[2024-05-23 22:09:04] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in LTL mode , in 1 iterations and 81264 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-05 finished in 369632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1))) U X(G(p2))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0200-LTLFireability-15
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:10:05] [INFO ] Invariant cache hit.
[2024-05-23 22:10:05] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20253ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20263ms
[2024-05-23 22:10:25] [INFO ] Invariant cache hit.
[2024-05-23 22:10:25] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-23 22:10:25] [INFO ] Invariant cache hit.
[2024-05-23 22:10:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:10:26] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:10:26] [INFO ] Invariant cache hit.
[2024-05-23 22:10:26] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 0.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 187.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 192.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 191.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 192.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 191.0)
(s39 5.0)
(s40 5.0)
(s41 189.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 192.0)
(s50 5.0)
(s51 2.0)
(s52 187.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 4.0)
(s59 192.0)
(s60 192.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 187.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s72 187.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 0.0)
(s78 191.0)
(s79 5.0)
(s80 192.0)
(s81 2.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 187.0)
(s88 4.0)
(s89 5.0)
(s90 192.0)
(s91 2.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 192.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 192.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 189.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 187.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 4.0)
(s119 192.0)
(s120 5.0)
(s121 2.0)
(s122 187.0)
(s123 4.0)
(s124 5.0)
(s125 192.0)
(s126 2.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s132 0.0)
(s133 191.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s137 0.0)
(s138 4.0)
(s139 192.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 192.0)
(s145 5.0)
(s146 2.0)
(s147 187.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 189.0)
(s152 0.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 189.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 192.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 5.0)
(s165 192.0)
(s166 2.0)
(s167 0.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 0.0)
(s173 191.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 191.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 191.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 0.0)
(s188 191.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 191.0)
(s194 5.0)
(s195 5.0)
(s196 189.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 192.0)
(s201 2.0)
(s202 0.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 189.0)
(s207 0.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 187.0)
(s213 4.0)
(s214 5.0)
(s215 192.0)
(s216 2.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 189.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s227 187.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 189.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 189.0)
(s237 0.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 191.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s247 187.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 192.0)
(s255 5.0)
(s256 189.0)
(s257 0.0)
(s258 4.0)
(s259 5.0)
(s260 192.0)
(s261 2.0)
(s262 0.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 187.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 0.0)
(s273 191.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 191.0)
(s279 5.0)
(s280 192.0)
(s281 2.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 187.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s292 187.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 187.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s302 187.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 0.0)
(s308 4.0)
(s309 192.0)
(s310 5.0)
(s311 2.0)
(s312 187.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s317 187.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s322 0.0)
(s323 191.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s327 0.0)
(s328 4.0)
(s329 192.0)
(s330 5.0)
(s331 2.0)
(s332 0.0)
(s333 191.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 192.0)
(s340 5.0)
(s341 2.0)
(s342 0.0)
(s343 191.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s347 0.0)
(s348 4.0)
(s349 192.0)
(s350 5.0)
(s351 2.0)
(s352 187.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s357 0.0)
(s358 191.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s362 0.0)
(s363 4.0)
(s364 192.0)
(s365 5.0)
(s366 189.0)
(s367 0.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s372 187.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s377 0.0)
(s378 191.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s382 0.0)
(s383 191.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s387 0.0)
(s388 4.0)
(s389 192.0)
(s390 5.0)
(s391 2.0)
(s392 187.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s397 0.0)
(s398 4.0)
(s399 192.0)
(s400 5.0)
(s401 2.0)
(s402 0.0)
(s403 4.0)
(s404 192.0)
(s405 5.0)
(s406 2.0)
(s407 0.0)
(s408 4.0)
(s409 192.0)
(s410 5.0)
(s411 189.0)
(s412 0.0)
(s413 4.0)
(s414 5.0)
(s415 192.0)
(s416 2.0)
(s417 0.0)
(s418 4.0)
(s419 5.0)
(s420 192.0)
(s421 2.0)
(s422 0.0)
(s423 4.0)
(s424 5.0)
(s425 192.0)
(s426 2.0)
(s427 0.0)
(s428 4.0)
(s429 5.0)
(s430 192.0)
(s431 2.0)
(s432 0.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s437 0.0)
(s438 191.0)
(s439 5.0)
(s440 5.0)
(s441 189.0)
(s442 0.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s447 0.0)
(s448 191.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s452 0.0)
(s453 4.0)
(s454 192.0)
(s455 5.0)
(s456 2.0)
(s457 187.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s462 187.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s467 187.0)
(s468 4.0)
(s469 5.0)
(s470 192.0)
(s471 2.0)
(s472 0.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s477 0.0)
(s478 4.0)
(s479 192.0)
(s480 5.0)
(s481 189.0)
(s482 0.0)
(s483 4.0)
(s484 5.0)
(s485 timeout
5.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 81326 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Running random walk in product with property : JoinFreeModules-PT-0200-LTLFireability-15
Product exploration explored 100000 steps with 33436 reset in 3055 ms.
Product exploration explored 100000 steps with 33373 reset in 3370 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 155 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40496 steps (8 resets) in 387 ms. (104 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
[2024-05-23 22:11:35] [INFO ] Invariant cache hit.
[2024-05-23 22:11:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:11:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 22:11:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/2601 variables, and 23 constraints, problems are : Problem set: 0 solved, 2 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:11:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/2601 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 354 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=70 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 p1))), (F p1)]
Knowledge based reduction with 17 factoid took 404 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:11:36] [INFO ] Invariant cache hit.
[2024-05-23 22:11:36] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)timeout
(s530 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20241ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20249ms
[2024-05-23 22:11:56] [INFO ] Invariant cache hit.
[2024-05-23 22:11:57] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 22:11:57] [INFO ] Invariant cache hit.
[2024-05-23 22:11:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:11:57] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:11:57] [INFO ] Invariant cache hit.
[2024-05-23 22:11:57] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 187)
(s298 4)
(s299 5)
(s300 5)
(s301 189)
(s302 0)
(s303 4)
(s304 5)
(s305 5)
(s306 2)
(s307 187)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 191)
(s314 5)
(s315 5)
(s316 189)
(s317 0)
(s318 4)
(s319 5)
(s320 5)
(s321 2)
(s322 0)
(s323 4)
(s324 192)
(s325 5)
(s326 2)
(s327 0)
(s328 191)
(s329 5)
(s330 5)
(s331 2)
(s332 187)
(s333 4)
(s334 5)
(s335 5)
(s336 2)
(s337 187)
(s338 4)
(s339 5)
(s340 192)
(s341 2)
(s342 0)
(s343 4)
(s344 5)
(s345 5)
(s346 2)
(s347 0)
(s348 4)
(s349 192)
(s350 192)
(s351 2)
(s352 0)
(s353 4)
(s354 5)
(s355 192)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 192)
(s361 2)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 2)
(s367 0)
(s368 191)
(s369 5)
(s370 5)
(s371 189)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 2)
(s377 0)
(s378 191)
(s379 5)
(s380 5)
(s381 2)
(s382 187)
(s383 4)
(s384 5)
(s385 5)
(s386 189)
(s387 0)
(s388 4)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 4)
(s394 192)
(s395 5)
(s396 189)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 2)
(s402 187)
(s403 4)
(s404 5)
(s405 5)
(s406 2)
(s407 187)
(s408 4)
(s409 5)
(s410 192)
(s411 2)
(s412 0)
(s413 4)
(s414 5)
(s415 5)
(s416 189)
(s417 0)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 0)
(s423 4)
(s424 192)
(s425 5)
(s426 189)
(s427 0)
(s428 4)
(s429 5)
(s430 5)
(s431 2)
(s432 0)
(s433 4)
(s434 192)
(s435 5)
(s436 2)
(s437 0)
(s438 4)
(s439 192)
(s440 5)
(s441 189)
(s442 0)
(s443 4)
(s444 5)
(s445 5)
(s446 189)
(s447 0)
(s448 4)
(s449 5)
(s450 192)
(s451 2)
(s452 0)
(s453 4)
(s454 5)
(s455 5)
(s456 2)
(s457 0)
(s458 4)
(s459 192)
(s460 5)
(s461 2)
(s462 187)
(s463 4)
(s464 5)
(s465 5)
(s466 2)
(s467 0)
(s468 4)
(s469 192)
(s470 5)
(s471 2)
(s472 187)
(s473 4)
(s474 5)
(s475 5)
(s476 2)
(s477 0)
(s478 191)
(s479 5)
(s480 5)
(s481 189)
(s482 0)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 4)
(s489 192)
(s490 192)
(s491 2)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 189)
(s497 0)
(s498 4)
(s499 5)
(s500 5)
(s501 2)
(s502 0)
(s503 4)
(s504 192)
(s505 5)
(s506 2)
(s507 187)
(s508 4)
(s509 5)
(s510 192)
(s511 2)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 191)
(s519 5)
(s520 5)
(s521 2)
(s522 0)
(s523 191)
(s524 5)
(s525 5)
(s526 2)
(s527 0)
(s528 191)
(s529 5)
(s530 5)
(s531 2)
(s532 0)
(s533 191)
(s534 5)
(s535 5)
(s536 2)
(s537 0)
(s538 191)
(s539 5)
(s540 5)
(s541 189)
(s542 0)
(s543 4)
(s544 5)
(s545 5)
(s546 2)
(s547 187)
(s548 4)
(s549 5)
(s550 5)
(s551 2)
(s552 0)
(s553 191)
(s554 5)
(s555 5)
(s556 2)
(s557 187)
(s558 4)
(s559 5)
(s560 5)
(s561 2)
(s562 0)
(s563 191)
(s564 5)
(s565 5)
(s566 2)
(s567 0)
(s568 191)
(s569 5)
(s570 192)
(s571 2)
(s572 0)
(s573 4)
(s574 5)
(s575 5)
(s576 2)
(s577 0)
(s578 191)
(s579 5)
(s580 5)
(s581 189)
(s582 0)
(s583 4)
(s584 5)
(s585 5)
(s586 189)
(s587 0)
(s588 4)
(s589 5)
(s590 5)
(s591 2)
(s592 187)
(s593 4)
(s594 5)
(s595 192)
(s596 2)
(s597 0)
(s598 4)
(s599 5)
(s600 192)
(s601 2)
(s602 0)
(s603 4)
(s604 5)
(s605 5)
(s606 2)
(s607 0)
(s608 4)
(s609 192)
(s610 5)
(s611 2)
(s612 187)
(s613 4)
(s614 5)
(s615 5)
(s616 189)
(s617 0)
(s618 4)
(s619 5)
(s620 5)
(s621 2)
(s622 187)
(s623 4)
(s624 5)
(s625 5)
(s626 2)
(s627 187)
(s628 4)
(s629 5)
(s630 5)
(s631 2)
(s632 187)
(s633 4)
(s634 5)
(s635 5)
(s636 2)
(s637 187)
(s638 4)
(s639 5)
(s640 5)
(s641 2)
(s642 0)
(s643 4)
(s644 192)
(s645 5)
(s646 2)
(s647 0)
(s648 191)
(s649 5)
(s650 5)
(s651 2)
(s652 0)
(s653 191)
(s654 5)
(s655 5)
(s656 2)
(s657 0)
(s658 4)
(s659 192)
(s660 5)
(s661 2)
(s662 0)
(s663 191)
(s664 5)
(s665 5)
(s666 2)
(s667 0)
(s668 4)
(s669 192)
(s670 5)
(s671 2)
(s672 187)
(s673 4)
(s674 5)
(s675 5)
(s676 2)
(s677 0)
(s678 191)
(s679 5)
(s680 5)
(s681 2)
(s682 0)
(s683 191)
(s684 5)
(s685 5)
(s686 2)
(s687 0)
(s688 4)
(s689 192)
(s690 5)
(s691 2)
(s692 187)
(s693 4)
(s694 5)
(s695 5)
(s696 189)
(s697 0)
(s698 4)
(s699 5)
(s700 192)
(s701 2)
(s702 0)
(s703 4)
(s704 5)
(s705 5)
(s706 2)
(s707 187)
(s708 4)
(s709 5)
(s710 5)
(s711 2)
(s712 0)
(s713 4)
(s714 192)
(s715 5)
(s716 189)
(s717 0)
(s718 4)
(s719 5)
(s720 5)
(s721 189)
(s722 0)
(s723 4)
(s724 5)
(s725 5)
(s726 2)
(s727 187)
(s728 4)
(s729 5)
(s730 192)
(s731 2)
(s732 0)
(s733 4)
(s734 5)
(s735 5)
(s736 2)
(s737 0)
(s738 191)
(s739 5)
(s740 5)
(s741 2)
(s742 0)
(s743 191)
(s744 5)
(s745 192)
(s746 2)
(s747 0)
(s748 4)
(s749 5)
(s750 5)
(s751 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in LTL mode , in 1 iterations and 81286 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 139 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40384 steps (8 resets) in 416 ms. (96 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
[2024-05-23 22:13:00] [INFO ] Invariant cache hit.
[2024-05-23 22:13:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:13:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 22:13:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/2601 variables, and 23 constraints, problems are : Problem set: 0 solved, 2 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:13:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/2601 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/200 constraints, State Equation: 15/1000 constraints, ReadFeed: 3/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 186ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 378 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F p1)]
Knowledge based reduction with 17 factoid took 430 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33275 reset in 3236 ms.
Product exploration explored 100000 steps with 33330 reset in 3492 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 37 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:13:08] [INFO ] Invariant cache hit.
[2024-05-23 22:13:08] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20256ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20265ms
[2024-05-23 22:13:29] [INFO ] Redundant transitions in 20 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:13:29] [INFO ] Invariant cache hit.
[2024-05-23 22:13:29] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80623 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:14:29] [INFO ] Invariant cache hit.
[2024-05-23 22:14:29] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20256ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20266ms
[2024-05-23 22:14:49] [INFO ] Invariant cache hit.
[2024-05-23 22:14:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 22:14:49] [INFO ] Invariant cache hit.
[2024-05-23 22:14:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-23 22:14:50] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-23 22:14:50] [INFO ] Invariant cache hit.
[2024-05-23 22:14:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 0.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 187.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 192.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 191.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 192.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 191.0)
(s39 5.0)
(s40 5.0)
(s41 189.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 192.0)
(s50 5.0)
(s51 2.0)
(s52 187.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 4.0)
(s59 192.0)
(s60 192.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 187.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s72 187.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 0.0)
(s78 191.0)
(s79 5.0)
(s80 192.0)
(s81 2.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 187.0)
(s88 4.0)
(s89 5.0)
(s90 192.0)
(s91 2.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 192.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 192.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 189.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s112 187.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 0.0)
(s118 4.0)
(s119 192.0)
(s120 5.0)
(s121 2.0)
(s122 187.0)
(s123 4.0)
(s124 5.0)
(s125 192.0)
(s126 2.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s132 0.0)
(s133 191.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s137 0.0)
(s138 4.0)
(s139 192.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 192.0)
(s145 5.0)
(s146 2.0)
(s147 187.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 189.0)
(s152 0.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 189.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 192.0)
(s161 2.0)
(s162 0.0)
(s163 4.0)
(s164 5.0)
(s165 192.0)
(s166 2.0)
(s167 0.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 0.0)
(s173 191.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s177 0.0)
(s178 191.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s182 0.0)
(s183 191.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 0.0)
(s188 191.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 191.0)
(s194 5.0)
(s195 5.0)
(s196 189.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 192.0)
(s201 2.0)
(s202 0.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 189.0)
(s207 0.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 187.0)
(s213 4.0)
(s214 5.0)
(s215 192.0)
(s216 2.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 189.0)
(s222 0.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s227 187.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 189.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 189.0)
(s237 0.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 191.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s247 187.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s252 0.0)
(s253 4.0)
(s254 192.0)
(s255 5.0)
(s256 189.0)
(s257 0.0)
(s258 4.0)
(s259 5.0)
(s260 192.0)
(s261 2.0)
(s262 0.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s267 187.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 0.0)
(s273 191.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 0.0)
(s278 191.0)
(s279 5.0)
(s280 192.0)
(s281 2.0)
(s282 0.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 187.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s292 187.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s297 187.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s302 187.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 0.0)
(s308 4.0)
(s309 192.0)
(s310 5.0)
(s311 2.0)
(s312 187.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s317 187.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s322 0.0)
(s323 191.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s327 0.0)
(s328 4.0)
(s329 192.0)
(s330 5.0)
(s331 2.0)
(s332 0.0)
(s333 191.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 192.0)
(s340 5.0)
(s341 2.0)
(s342 0.0)
(s343 191.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s347 0.0)
(s348 4.0)
(s349 192.0)
(s350 5.0)
(s351 2.0)
(s352 187.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s357 0.0)
(s358 191.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s362 0.0)
(s363 4.0)
(s364 192.0)
(s365 5.0)
(s366 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in LTL mode , in 1 iterations and 81312 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLFireability-15 finished in 345655 ms.
[2024-05-23 22:15:50] [INFO ] Flatten gal took : 57 ms
[2024-05-23 22:15:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 22:15:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1601 transitions and 4600 arcs took 13 ms.
Total runtime 2453455 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running JoinFreeModules-PT-0200
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1000
TRANSITIONS: 1601
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.004s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2231
MODEL NAME: /home/mcc/execution/412/model
1000 places, 1601 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716503532912
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is JoinFreeModules-PT-0200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649610600060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;