About the Execution of GreatSPN+red for DLCround-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9887.947 | 3600000.00 | 9678791.00 | 7904.90 | FFFTFT?FFFFTFFTF | 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.r113-smll-171624274400172.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 DLCround-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274400172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K 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 DLCround-PT-06b-LTLFireability-00
FORMULA_NAME DLCround-PT-06b-LTLFireability-01
FORMULA_NAME DLCround-PT-06b-LTLFireability-02
FORMULA_NAME DLCround-PT-06b-LTLFireability-03
FORMULA_NAME DLCround-PT-06b-LTLFireability-04
FORMULA_NAME DLCround-PT-06b-LTLFireability-05
FORMULA_NAME DLCround-PT-06b-LTLFireability-06
FORMULA_NAME DLCround-PT-06b-LTLFireability-07
FORMULA_NAME DLCround-PT-06b-LTLFireability-08
FORMULA_NAME DLCround-PT-06b-LTLFireability-09
FORMULA_NAME DLCround-PT-06b-LTLFireability-10
FORMULA_NAME DLCround-PT-06b-LTLFireability-11
FORMULA_NAME DLCround-PT-06b-LTLFireability-12
FORMULA_NAME DLCround-PT-06b-LTLFireability-13
FORMULA_NAME DLCround-PT-06b-LTLFireability-14
FORMULA_NAME DLCround-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716360442096
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:47:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 06:47:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:47:24] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-05-22 06:47:24] [INFO ] Transformed 2340 places.
[2024-05-22 06:47:24] [INFO ] Transformed 3456 transitions.
[2024-05-22 06:47:24] [INFO ] Found NUPN structural information;
[2024-05-22 06:47:24] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 592 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-06b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 405 places :
Symmetric choice reduction at 0 with 405 rule applications. Total rules 405 place count 1935 transition count 3051
Iterating global reduction 0 with 405 rules applied. Total rules applied 810 place count 1935 transition count 3051
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 1130 place count 1615 transition count 2731
Iterating global reduction 0 with 320 rules applied. Total rules applied 1450 place count 1615 transition count 2731
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1457 place count 1615 transition count 2724
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 1507 place count 1565 transition count 2625
Iterating global reduction 1 with 50 rules applied. Total rules applied 1557 place count 1565 transition count 2625
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1589 place count 1533 transition count 2593
Iterating global reduction 1 with 32 rules applied. Total rules applied 1621 place count 1533 transition count 2593
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1625 place count 1533 transition count 2589
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1642 place count 1516 transition count 2572
Iterating global reduction 2 with 17 rules applied. Total rules applied 1659 place count 1516 transition count 2572
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1675 place count 1500 transition count 2556
Iterating global reduction 2 with 16 rules applied. Total rules applied 1691 place count 1500 transition count 2556
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1707 place count 1484 transition count 2540
Iterating global reduction 2 with 16 rules applied. Total rules applied 1723 place count 1484 transition count 2540
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1733 place count 1474 transition count 2530
Iterating global reduction 2 with 10 rules applied. Total rules applied 1743 place count 1474 transition count 2530
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1749 place count 1468 transition count 2524
Iterating global reduction 2 with 6 rules applied. Total rules applied 1755 place count 1468 transition count 2524
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1761 place count 1462 transition count 2518
Iterating global reduction 2 with 6 rules applied. Total rules applied 1767 place count 1462 transition count 2518
Applied a total of 1767 rules in 1732 ms. Remains 1462 /2340 variables (removed 878) and now considering 2518/3456 (removed 938) transitions.
// Phase 1: matrix 2518 rows 1462 cols
[2024-05-22 06:47:26] [INFO ] Computed 109 invariants in 50 ms
[2024-05-22 06:47:28] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2024-05-22 06:47:28] [INFO ] Invariant cache hit.
[2024-05-22 06:47:29] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 3319 ms to find 0 implicit places.
Running 2517 sub problems to find dead transitions.
[2024-05-22 06:47:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1461/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2517 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1462 constraints, PredecessorRefiner: 2517/2517 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2517 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1461/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2517 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1462 constraints, PredecessorRefiner: 0/2517 constraints, Known Traps: 0/0 constraints]
After SMT, in 61866ms problems are : Problem set: 0 solved, 2517 unsolved
Search for dead transitions found 0 dead transitions in 61943ms
Starting structural reductions in LTL mode, iteration 1 : 1462/2340 places, 2518/3456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67045 ms. Remains : 1462/2340 places, 2518/3456 transitions.
Support contains 48 out of 1462 places after structural reductions.
[2024-05-22 06:48:32] [INFO ] Flatten gal took : 261 ms
[2024-05-22 06:48:32] [INFO ] Flatten gal took : 153 ms
[2024-05-22 06:48:33] [INFO ] Input system was already deterministic with 2518 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (8 resets) in 3293 ms. (12 steps per ms) remains 1/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
[2024-05-22 06:48:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/189 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1273/1462 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1462 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2518/3980 variables, 1462/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3980 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3980 variables, 0/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3980/3980 variables, and 1571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1462/1462 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/189 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1273/1462 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1462 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2518/3980 variables, 1462/1571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3980 variables, 1/1572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3980 variables, 0/1572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3980 variables, 0/1572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3980/3980 variables, and 1572 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1462/1462 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3171ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 541 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 18 ms.
Computed a total of 225 stabilizing places and 225 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(X(G(p0))))'
Support contains 1 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 503 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 06:48:38] [INFO ] Computed 109 invariants in 15 ms
[2024-05-22 06:48:39] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-22 06:48:39] [INFO ] Invariant cache hit.
[2024-05-22 06:48:40] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2024-05-22 06:48:40] [INFO ] Invariant cache hit.
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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints]
After SMT, in 61318ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 61348ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64509 ms. Remains : 1431/1462 places, 2469/2518 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-00 finished in 64924 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)||F(p1)))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1321 edges and 1462 vertex of which 391 / 1462 are part of one of the 32 SCC in 8 ms
Free SCC test removed 359 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 1102 transition count 1882
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 280 rules applied. Total rules applied 528 place count 855 transition count 1849
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 550 place count 833 transition count 1849
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 550 place count 833 transition count 1741
Deduced a syphon composed of 108 places in 5 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 766 place count 725 transition count 1741
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 822 place count 669 transition count 1406
Iterating global reduction 3 with 56 rules applied. Total rules applied 878 place count 669 transition count 1406
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 881 place count 669 transition count 1403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 881 place count 669 transition count 1400
Deduced a syphon composed of 3 places in 19 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 887 place count 666 transition count 1400
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 498 rules applied. Total rules applied 1385 place count 417 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1392 place count 417 transition count 1137
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1411 place count 398 transition count 962
Iterating global reduction 5 with 19 rules applied. Total rules applied 1430 place count 398 transition count 962
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1448 place count 398 transition count 944
Performed 16 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1480 place count 382 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1484 place count 378 transition count 1007
Iterating global reduction 6 with 4 rules applied. Total rules applied 1488 place count 378 transition count 1007
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1517 place count 378 transition count 978
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 1547 place count 378 transition count 948
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1561 place count 364 transition count 920
Iterating global reduction 7 with 14 rules applied. Total rules applied 1575 place count 364 transition count 920
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1589 place count 350 transition count 778
Iterating global reduction 7 with 14 rules applied. Total rules applied 1603 place count 350 transition count 778
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1617 place count 350 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 349 transition count 763
Applied a total of 1618 rules in 522 ms. Remains 349 /1462 variables (removed 1113) and now considering 763/2518 (removed 1755) transitions.
[2024-05-22 06:49:43] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
// Phase 1: matrix 741 rows 349 cols
[2024-05-22 06:49:43] [INFO ] Computed 109 invariants in 5 ms
[2024-05-22 06:49:43] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-22 06:49:43] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
[2024-05-22 06:49:43] [INFO ] Invariant cache hit.
[2024-05-22 06:49:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 06:49:44] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2024-05-22 06:49:44] [INFO ] Redundant transitions in 48 ms returned []
Running 702 sub problems to find dead transitions.
[2024-05-22 06:49:44] [INFO ] Flow matrix only has 741 transitions (discarded 22 similar events)
[2024-05-22 06:49:44] [INFO ] Invariant cache hit.
[2024-05-22 06:49:44] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (OVERLAPS) 1/349 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 740/1089 variables, 349/458 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1089 variables, 40/498 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1089/1090 variables, and 498 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 349/349 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (OVERLAPS) 1/349 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 740/1089 variables, 349/458 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1089 variables, 40/498 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1089 variables, 702/1200 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1089/1090 variables, and 1200 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 349/349 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1462 places, 763/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62015 ms. Remains : 349/1462 places, 763/2518 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-01 finished in 62118 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(p1)))))'
Support contains 2 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 670 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2024-05-22 06:50:45] [INFO ] Computed 109 invariants in 13 ms
[2024-05-22 06:50:46] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-22 06:50:46] [INFO ] Invariant cache hit.
[2024-05-22 06:50:47] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2024-05-22 06:50:48] [INFO ] Invariant cache hit.
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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints]
After SMT, in 61094ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 61124ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64333 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-02 finished in 64500 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((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 640 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
[2024-05-22 06:51:49] [INFO ] Invariant cache hit.
[2024-05-22 06:51:50] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-22 06:51:50] [INFO ] Invariant cache hit.
[2024-05-22 06:51:52] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2024-05-22 06:51:52] [INFO ] Invariant cache hit.
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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 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 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints]
After SMT, in 61074ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 61100ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64226 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 812 ms.
Product exploration explored 100000 steps with 50000 reset in 609 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-03 finished in 65992 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' '!((!p0 U ((p1 U p2)||X(F(p3)))))'
Support contains 7 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1452 transition count 2499
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1452 transition count 2499
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1447 transition count 2494
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1447 transition count 2494
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1445 transition count 2492
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1445 transition count 2492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2490
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2488
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2486
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2484
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2482
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1434 transition count 2481
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1434 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1433 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1433 transition count 2480
Applied a total of 58 rules in 664 ms. Remains 1433 /1462 variables (removed 29) and now considering 2480/2518 (removed 38) transitions.
// Phase 1: matrix 2480 rows 1433 cols
[2024-05-22 06:52:55] [INFO ] Computed 109 invariants in 14 ms
[2024-05-22 06:52:56] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-22 06:52:56] [INFO ] Invariant cache hit.
[2024-05-22 06:52:58] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned []
Implicit Place search using SMT with State Equation took 2688 ms to find 0 implicit places.
Running 2479 sub problems to find dead transitions.
[2024-05-22 06:52:58] [INFO ] Invariant cache hit.
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 1432/3913 variables, and 0 constraints, problems are : Problem set: 0 solved, 2479 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1433 constraints, PredecessorRefiner: 2479/2479 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2479 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 1432/3913 variables, and 0 constraints, problems are : Problem set: 0 solved, 2479 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1433 constraints, PredecessorRefiner: 0/2479 constraints, Known Traps: 0/0 constraints]
After SMT, in 61274ms problems are : Problem set: 0 solved, 2479 unsolved
Search for dead transitions found 0 dead transitions in 61300ms
Starting structural reductions in LTL mode, iteration 1 : 1433/1462 places, 2480/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64668 ms. Remains : 1433/1462 places, 2480/2518 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-04
Product exploration explored 100000 steps with 133 reset in 493 ms.
Product exploration explored 100000 steps with 129 reset in 483 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 146 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 757 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1071 ms. (37 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
[2024-05-22 06:54:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 329/336 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1097/1433 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1433 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2480/3913 variables, 1433/1542 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3913 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/3913 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3913/3913 variables, and 1542 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1433/1433 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 329/336 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1097/1433 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 06:54:08] [INFO ] Deduced a trap composed of 83 places in 528 ms of which 62 ms to minimize.
[2024-05-22 06:54:08] [INFO ] Deduced a trap composed of 72 places in 413 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1433 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1433 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2480/3913 variables, 1433/1544 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3913 variables, 11/1555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3913 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3913/3913 variables, and 1555 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1433/1433 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
After SMT, in 8669ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 1433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1433/1433 places, 2480/2480 transitions.
Graph (trivial) has 1287 edges and 1433 vertex of which 389 / 1433 are part of one of the 32 SCC in 3 ms
Free SCC test removed 357 places
Drop transitions (Empty/Sink Transition effects.) removed 407 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 1076 transition count 1838
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 257 rules applied. Total rules applied 482 place count 852 transition count 1805
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 505 place count 830 transition count 1804
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 506 place count 829 transition count 1804
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 506 place count 829 transition count 1694
Deduced a syphon composed of 110 places in 14 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 726 place count 719 transition count 1694
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 776 place count 669 transition count 1368
Iterating global reduction 4 with 50 rules applied. Total rules applied 826 place count 669 transition count 1368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 830 place count 669 transition count 1364
Performed 250 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 5 with 500 rules applied. Total rules applied 1330 place count 419 transition count 1109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1337 place count 419 transition count 1102
Renaming transitions due to excessive name length > 1024 char.
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1354 place count 402 transition count 944
Iterating global reduction 6 with 17 rules applied. Total rules applied 1371 place count 402 transition count 944
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1388 place count 402 transition count 927
Performed 38 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 1464 place count 364 transition count 1235
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1481 place count 364 transition count 1218
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1499 place count 346 transition count 875
Iterating global reduction 8 with 18 rules applied. Total rules applied 1517 place count 346 transition count 875
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1559 place count 346 transition count 833
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 9 with 94 rules applied. Total rules applied 1653 place count 346 transition count 739
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1660 place count 339 transition count 667
Iterating global reduction 9 with 7 rules applied. Total rules applied 1667 place count 339 transition count 667
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1672 place count 339 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1680 place count 335 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1685 place count 335 transition count 687
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 11 with 24 rules applied. Total rules applied 1709 place count 335 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1717 place count 331 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1723 place count 331 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1744 place count 331 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1752 place count 327 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1758 place count 327 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1779 place count 327 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 1787 place count 323 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1793 place count 323 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 1814 place count 323 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1822 place count 319 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1828 place count 319 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1849 place count 319 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1857 place count 315 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 1863 place count 315 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 1884 place count 315 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 1892 place count 311 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 1899 place count 311 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 17 with 20 rules applied. Total rules applied 1919 place count 311 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 1927 place count 307 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1933 place count 307 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 1954 place count 307 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 1962 place count 303 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1968 place count 303 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 1989 place count 303 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 1997 place count 299 transition count 690
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2003 place count 299 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2024 place count 299 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2032 place count 295 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2038 place count 295 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 21 with 22 rules applied. Total rules applied 2060 place count 295 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2068 place count 291 transition count 692
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2074 place count 291 transition count 686
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 22 with 23 rules applied. Total rules applied 2097 place count 291 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2105 place count 287 transition count 689
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 2110 place count 287 transition count 684
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2131 place count 287 transition count 663
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2139 place count 283 transition count 686
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 2143 place count 283 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 24 with 20 rules applied. Total rules applied 2163 place count 283 transition count 662
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2171 place count 279 transition count 681
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 2175 place count 279 transition count 677
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 25 with 19 rules applied. Total rules applied 2194 place count 279 transition count 658
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2202 place count 275 transition count 677
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 2206 place count 275 transition count 673
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 26 with 19 rules applied. Total rules applied 2225 place count 275 transition count 654
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2233 place count 271 transition count 674
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2237 place count 271 transition count 670
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 2257 place count 271 transition count 650
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2265 place count 267 transition count 670
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2269 place count 267 transition count 666
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 28 with 20 rules applied. Total rules applied 2289 place count 267 transition count 646
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2297 place count 263 transition count 665
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2301 place count 263 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 29 with 19 rules applied. Total rules applied 2320 place count 263 transition count 642
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2328 place count 259 transition count 662
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2332 place count 259 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 30 with 20 rules applied. Total rules applied 2352 place count 259 transition count 638
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2360 place count 255 transition count 658
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2364 place count 255 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 31 with 20 rules applied. Total rules applied 2384 place count 255 transition count 634
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 2392 place count 251 transition count 653
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 2396 place count 251 transition count 649
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 2415 place count 251 transition count 630
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 2419 place count 249 transition count 635
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 2421 place count 249 transition count 633
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 33 with 5 rules applied. Total rules applied 2426 place count 249 transition count 628
Free-agglomeration rule applied 29 times with reduction of 1 identical transitions.
Iterating global reduction 33 with 29 rules applied. Total rules applied 2455 place count 249 transition count 598
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 209 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 212 transitions.
Graph (complete) has 646 edges and 220 vertex of which 168 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 0 output transitions
Iterating post reduction 33 with 242 rules applied. Total rules applied 2697 place count 168 transition count 386
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 34 with 52 rules applied. Total rules applied 2749 place count 168 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 35 with 38 rules applied. Total rules applied 2787 place count 168 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 35 with 1 rules applied. Total rules applied 2788 place count 167 transition count 295
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 35 with 5 rules applied. Total rules applied 2793 place count 163 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 2794 place count 162 transition count 294
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 37 with 53 rules applied. Total rules applied 2847 place count 127 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 37 with 46 rules applied. Total rules applied 2893 place count 127 transition count 230
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 38 with 72 rules applied. Total rules applied 2965 place count 79 transition count 206
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (trivial) has 9 edges and 79 vertex of which 8 / 79 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 59 rules applied. Total rules applied 3024 place count 75 transition count 148
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 124 edges and 71 vertex of which 46 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 39 with 64 rules applied. Total rules applied 3088 place count 46 transition count 77
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 40 with 14 rules applied. Total rules applied 3102 place count 45 transition count 64
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 41 with 12 rules applied. Total rules applied 3114 place count 37 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 41 with 8 rules applied. Total rules applied 3122 place count 37 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 42 with 24 rules applied. Total rules applied 3146 place count 21 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 42 with 16 rules applied. Total rules applied 3162 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 43 with 5 rules applied. Total rules applied 3167 place count 21 transition count 23
Graph (complete) has 34 edges and 21 vertex of which 19 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 43 with 1 rules applied. Total rules applied 3168 place count 19 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 44 with 2 rules applied. Total rules applied 3170 place count 19 transition count 21
Applied a total of 3170 rules in 869 ms. Remains 19 /1433 variables (removed 1414) and now considering 21/2480 (removed 2459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 869 ms. Remains : 19/1433 places, 21/2480 transitions.
RANDOM walk for 828 steps (0 resets) in 16 ms. (48 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p3))), (F p3), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F p1)]
Knowledge based reduction with 19 factoid took 765 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 699 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 798 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
[2024-05-22 06:54:14] [INFO ] Invariant cache hit.
[2024-05-22 06:54:17] [INFO ] [Real]Absence check using 109 positive place invariants in 162 ms returned sat
[2024-05-22 06:54:21] [INFO ] [Real]Absence check using state equation in 4725 ms returned sat
[2024-05-22 06:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:54:23] [INFO ] [Nat]Absence check using 109 positive place invariants in 158 ms returned sat
[2024-05-22 06:54:28] [INFO ] [Nat]Absence check using state equation in 4636 ms returned sat
[2024-05-22 06:54:28] [INFO ] Computed and/alt/rep : 2318/3950/2318 causal constraints (skipped 161 transitions) in 248 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 06:54:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p2) (NOT p3))
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 7 out of 1433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1433/1433 places, 2480/2480 transitions.
Graph (trivial) has 1287 edges and 1433 vertex of which 389 / 1433 are part of one of the 32 SCC in 1 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 1075 transition count 1869
Reduce places removed 224 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 257 rules applied. Total rules applied 482 place count 851 transition count 1836
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 505 place count 829 transition count 1835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 506 place count 828 transition count 1835
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 506 place count 828 transition count 1725
Deduced a syphon composed of 110 places in 10 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 726 place count 718 transition count 1725
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 776 place count 668 transition count 1399
Iterating global reduction 4 with 50 rules applied. Total rules applied 826 place count 668 transition count 1399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 830 place count 668 transition count 1395
Performed 248 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 248 places in 1 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 5 with 496 rules applied. Total rules applied 1326 place count 420 transition count 1142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1333 place count 420 transition count 1135
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1350 place count 403 transition count 977
Iterating global reduction 6 with 17 rules applied. Total rules applied 1367 place count 403 transition count 977
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1384 place count 403 transition count 960
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1418 place count 386 transition count 1094
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1422 place count 382 transition count 1032
Iterating global reduction 7 with 4 rules applied. Total rules applied 1426 place count 382 transition count 1032
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 1456 place count 382 transition count 1002
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1488 place count 382 transition count 970
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1500 place count 370 transition count 946
Iterating global reduction 8 with 12 rules applied. Total rules applied 1512 place count 370 transition count 946
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1524 place count 358 transition count 823
Iterating global reduction 8 with 12 rules applied. Total rules applied 1536 place count 358 transition count 823
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1548 place count 358 transition count 811
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 358 transition count 811
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 358 transition count 810
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1552 place count 357 transition count 808
Iterating global reduction 9 with 1 rules applied. Total rules applied 1553 place count 357 transition count 808
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1554 place count 356 transition count 797
Iterating global reduction 9 with 1 rules applied. Total rules applied 1555 place count 356 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1556 place count 356 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1557 place count 355 transition count 795
Applied a total of 1557 rules in 281 ms. Remains 355 /1433 variables (removed 1078) and now considering 795/2480 (removed 1685) transitions.
[2024-05-22 06:54:37] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
// Phase 1: matrix 772 rows 355 cols
[2024-05-22 06:54:37] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 06:54:37] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 06:54:37] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 06:54:37] [INFO ] Invariant cache hit.
[2024-05-22 06:54:37] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 06:54:38] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-05-22 06:54:38] [INFO ] Redundant transitions in 13 ms returned []
Running 732 sub problems to find dead transitions.
[2024-05-22 06:54:38] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 06:54:38] [INFO ] Invariant cache hit.
[2024-05-22 06:54:38] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 771/1126 variables, 355/464 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1126 variables, 46/510 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1126/1127 variables, and 510 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 355/355 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/355 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 771/1126 variables, 355/464 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1126 variables, 46/510 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 732/1242 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/1127 variables, and 1242 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 355/355 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 355/1433 places, 795/2480 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61703 ms. Remains : 355/1433 places, 795/2480 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 35 factoid took 688 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 676 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1580 ms. (25 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
[2024-05-22 06:55:40] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 06:55:40] [INFO ] Invariant cache hit.
[2024-05-22 06:55:40] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/315 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 729/1044 variables, 315/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 18/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 82/1126 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1126 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1126 variables, 28/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1126 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1127 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 355/355 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/315 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 729/1044 variables, 315/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1044 variables, 18/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1044 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 82/1126 variables, 40/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1126 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1126 variables, 28/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1126 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1126 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1127 variables, and 512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 355/355 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
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 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p3))), (F p3), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F p1)]
Knowledge based reduction with 35 factoid took 1387 ms. Reduced automaton from 16 states, 69 edges and 4 AP (stutter insensitive) to 16 states, 69 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 676 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 669 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
[2024-05-22 06:55:44] [INFO ] Flow matrix only has 772 transitions (discarded 23 similar events)
[2024-05-22 06:55:44] [INFO ] Invariant cache hit.
[2024-05-22 06:55:45] [INFO ] [Real]Absence check using 109 positive place invariants in 63 ms returned sat
[2024-05-22 06:55:45] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-22 06:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:55:46] [INFO ] [Nat]Absence check using 109 positive place invariants in 47 ms returned sat
[2024-05-22 06:55:46] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-05-22 06:55:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 06:55:46] [INFO ] [Nat]Added 46 Read/Feed constraints in 10 ms returned sat
[2024-05-22 06:55:46] [INFO ] Computed and/alt/rep : 494/1239/494 causal constraints (skipped 225 transitions) in 74 ms.
[2024-05-22 06:55:46] [INFO ] Added : 3 causal constraints over 1 iterations in 172 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 767 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-04 finished in 172347 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)||X((p1||X(F(p2)))))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1450 transition count 2488
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1450 transition count 2488
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1444 transition count 2482
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1432 transition count 2470
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1430 transition count 2468
Applied a total of 64 rules in 649 ms. Remains 1430 /1462 variables (removed 32) and now considering 2468/2518 (removed 50) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2024-05-22 06:55:48] [INFO ] Computed 109 invariants in 9 ms
[2024-05-22 06:55:48] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-22 06:55:48] [INFO ] Invariant cache hit.
[2024-05-22 06:55:50] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2024-05-22 06:55:50] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints]
After SMT, in 61017ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 61042ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1462 places, 2468/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64162 ms. Remains : 1430/1462 places, 2468/2518 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 410 ms.
Product exploration explored 100000 steps with 33333 reset in 436 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1430 stabilizing places and 213/2468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-05 finished in 65282 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(p0)&&F(p1))||(X(F(p3))&&p2))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1446 transition count 2484
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1446 transition count 2484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1444 transition count 2482
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1442 transition count 2480
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1440 transition count 2478
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1440 transition count 2478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1438 transition count 2476
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1438 transition count 2476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1436 transition count 2474
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1436 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1434 transition count 2472
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1434 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1433 transition count 2471
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Applied a total of 60 rules in 648 ms. Remains 1432 /1462 variables (removed 30) and now considering 2470/2518 (removed 48) transitions.
// Phase 1: matrix 2470 rows 1432 cols
[2024-05-22 06:56:53] [INFO ] Computed 109 invariants in 12 ms
[2024-05-22 06:56:54] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-22 06:56:54] [INFO ] Invariant cache hit.
[2024-05-22 06:56:55] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
Running 2469 sub problems to find dead transitions.
[2024-05-22 06:56:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 2469/2469 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/2469 constraints, Known Traps: 0/0 constraints]
After SMT, in 61009ms problems are : Problem set: 0 solved, 2469 unsolved
Search for dead transitions found 0 dead transitions in 61033ms
Starting structural reductions in LTL mode, iteration 1 : 1432/1462 places, 2470/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64054 ms. Remains : 1432/1462 places, 2470/2518 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-06
Product exploration explored 100000 steps with 56 reset in 528 ms.
Product exploration explored 100000 steps with 59 reset in 832 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Detected a total of 213/1432 stabilizing places and 213/2470 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 14317 steps (2 resets) in 107 ms. (132 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-22 06:57:59] [INFO ] Invariant cache hit.
[2024-05-22 06:58:01] [INFO ] [Real]Absence check using 109 positive place invariants in 166 ms returned sat
[2024-05-22 06:58:06] [INFO ] [Real]Absence check using state equation in 4647 ms returned sat
[2024-05-22 06:58:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:58:08] [INFO ] [Nat]Absence check using 109 positive place invariants in 164 ms returned sat
[2024-05-22 06:58:12] [INFO ] [Nat]Absence check using state equation in 4545 ms returned sat
[2024-05-22 06:58:13] [INFO ] Computed and/alt/rep : 2309/3952/2309 causal constraints (skipped 160 transitions) in 192 ms.
Could not prove EG (NOT p1)
Support contains 2 out of 1432 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Applied a total of 0 rules in 53 ms. Remains 1432 /1432 variables (removed 0) and now considering 2470/2470 (removed 0) transitions.
[2024-05-22 06:58:21] [INFO ] Invariant cache hit.
[2024-05-22 06:58:21] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-22 06:58:21] [INFO ] Invariant cache hit.
[2024-05-22 06:58:23] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
Running 2469 sub problems to find dead transitions.
[2024-05-22 06:58:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 2469/2469 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1431/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 2469 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/2469 constraints, Known Traps: 0/0 constraints]
After SMT, in 61067ms problems are : Problem set: 0 solved, 2469 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Finished structural reductions in LTL mode , in 1 iterations and 63685 ms. Remains : 1432/1432 places, 2470/2470 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 15997 steps (3 resets) in 91 ms. (173 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-22 06:59:25] [INFO ] Invariant cache hit.
[2024-05-22 06:59:27] [INFO ] [Real]Absence check using 109 positive place invariants in 210 ms returned sat
[2024-05-22 06:59:32] [INFO ] [Real]Absence check using state equation in 4631 ms returned sat
[2024-05-22 06:59:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:59:35] [INFO ] [Nat]Absence check using 109 positive place invariants in 178 ms returned sat
[2024-05-22 06:59:39] [INFO ] [Nat]Absence check using state equation in 4653 ms returned sat
[2024-05-22 06:59:39] [INFO ] Computed and/alt/rep : 2309/3952/2309 causal constraints (skipped 160 transitions) in 186 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 06:59:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33 reset in 471 ms.
Product exploration explored 100000 steps with 25 reset in 560 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Graph (trivial) has 1296 edges and 1432 vertex of which 389 / 1432 are part of one of the 32 SCC in 1 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 227 rules applied. Total rules applied 228 place count 1075 transition count 2084
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 250 place count 1075 transition count 2073
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 250 place count 1075 transition count 2077
Deduced a syphon composed of 246 places in 7 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 1075 transition count 2077
Discarding 121 places :
Symmetric choice reduction at 2 with 121 rule applications. Total rules 379 place count 954 transition count 1689
Deduced a syphon composed of 175 places in 5 ms
Iterating global reduction 2 with 121 rules applied. Total rules applied 500 place count 954 transition count 1689
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 504 place count 954 transition count 1685
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 526 places in 0 ms
Iterating global reduction 3 with 351 rules applied. Total rules applied 855 place count 954 transition count 1692
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 862 place count 954 transition count 1685
Renaming transitions due to excessive name length > 1024 char.
Discarding 263 places :
Symmetric choice reduction at 4 with 263 rule applications. Total rules 1125 place count 691 transition count 1272
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 4 with 263 rules applied. Total rules applied 1388 place count 691 transition count 1272
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1406 place count 691 transition count 1254
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1413 place count 684 transition count 1247
Deduced a syphon composed of 274 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1420 place count 684 transition count 1247
Performed 29 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 303 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1449 place count 684 transition count 1470
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1464 place count 684 transition count 1455
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1504 place count 644 transition count 1316
Deduced a syphon composed of 267 places in 0 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1544 place count 644 transition count 1316
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1576 place count 644 transition count 1284
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1584 place count 636 transition count 1268
Deduced a syphon composed of 259 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1592 place count 636 transition count 1268
Deduced a syphon composed of 259 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1625 place count 636 transition count 1235
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1638 place count 623 transition count 1209
Deduced a syphon composed of 259 places in 0 ms
Iterating global reduction 7 with 13 rules applied. Total rules applied 1651 place count 623 transition count 1209
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1664 place count 610 transition count 1073
Deduced a syphon composed of 259 places in 0 ms
Iterating global reduction 7 with 13 rules applied. Total rules applied 1677 place count 610 transition count 1073
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1697 place count 610 transition count 1053
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1710 place count 597 transition count 1033
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 8 with 13 rules applied. Total rules applied 1723 place count 597 transition count 1033
Deduced a syphon composed of 246 places in 0 ms
Applied a total of 1723 rules in 833 ms. Remains 597 /1432 variables (removed 835) and now considering 1033/2470 (removed 1437) transitions.
[2024-05-22 06:59:50] [INFO ] Redundant transitions in 26 ms returned []
Running 1032 sub problems to find dead transitions.
[2024-05-22 06:59:50] [INFO ] Flow matrix only has 1013 transitions (discarded 20 similar events)
// Phase 1: matrix 1013 rows 597 cols
[2024-05-22 06:59:50] [INFO ] Computed 109 invariants in 18 ms
[2024-05-22 06:59:50] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 1032 unsolved
[2024-05-22 07:00:14] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 7 ms to minimize.
[2024-05-22 07:00:15] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 3 ms to minimize.
[2024-05-22 07:00:15] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:00:15] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:00:17] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
[2024-05-22 07:00:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
[2024-05-22 07:00:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
[2024-05-22 07:00:17] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
[2024-05-22 07:00:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
[2024-05-22 07:00:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
[2024-05-22 07:00:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
[2024-05-22 07:00:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
[2024-05-22 07:00:19] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/129 constraints. Problems are: Problem set: 185 solved, 847 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1610 variables, and 129 constraints, problems are : Problem set: 185 solved, 847 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/597 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 1032/1032 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 185 solved, 847 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 185 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 158/597 variables, 109/109 constraints. Problems are: Problem set: 185 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/129 constraints. Problems are: Problem set: 185 solved, 847 unsolved
[2024-05-22 07:00:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD311 is UNSAT
[2024-05-22 07:00:32] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD316 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD344 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD349 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD366 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD379 is UNSAT
[2024-05-22 07:00:33] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD384 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD392 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD397 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD405 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD410 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD418 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD423 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD429 is UNSAT
[2024-05-22 07:00:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/149 constraints. Problems are: Problem set: 205 solved, 827 unsolved
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD440 is UNSAT
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD445 is UNSAT
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Problem TDEAD451 is UNSAT
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD456 is UNSAT
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Problem TDEAD462 is UNSAT
[2024-05-22 07:00:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD467 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD473 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD478 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD484 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD489 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD495 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD500 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD506 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD511 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
Problem TDEAD517 is UNSAT
[2024-05-22 07:00:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD522 is UNSAT
[2024-05-22 07:00:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD528 is UNSAT
[2024-05-22 07:00:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD533 is UNSAT
[2024-05-22 07:00:41] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD539 is UNSAT
[2024-05-22 07:00:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD440 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD544 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/169 constraints. Problems are: Problem set: 225 solved, 807 unsolved
[2024-05-22 07:00:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD550 is UNSAT
[2024-05-22 07:00:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD555 is UNSAT
[2024-05-22 07:00:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD561 is UNSAT
[2024-05-22 07:00:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD566 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD572 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD577 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD583 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD588 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD594 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD600 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD606 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD612 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD618 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD624 is UNSAT
[2024-05-22 07:00:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD630 is UNSAT
[2024-05-22 07:00:48] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD636 is UNSAT
[2024-05-22 07:00:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD642 is UNSAT
[2024-05-22 07:00:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD648 is UNSAT
[2024-05-22 07:00:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD654 is UNSAT
[2024-05-22 07:00:48] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD660 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/189 constraints. Problems are: Problem set: 245 solved, 787 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/1610 variables, and 189 constraints, problems are : Problem set: 245 solved, 787 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/597 constraints, ReadFeed: 0/134 constraints, PredecessorRefiner: 0/1032 constraints, Known Traps: 80/80 constraints]
After SMT, in 61119ms problems are : Problem set: 245 solved, 787 unsolved
Search for dead transitions found 245 dead transitions in 61132ms
Found 245 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 245 transitions
Dead transitions reduction (with SMT) removed 245 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 597/1432 places, 788/2470 transitions.
Graph (complete) has 1421 edges and 597 vertex of which 380 are kept as prefixes of interest. Removing 217 places using SCC suffix rule.1 ms
Discarding 217 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 380 transition count 825
Deduced a syphon composed of 33 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 30 place count 380 transition count 800
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 380 transition count 837
Deduced a syphon composed of 37 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 59 place count 380 transition count 812
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 380 transition count 849
Deduced a syphon composed of 41 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 88 place count 380 transition count 824
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 380 transition count 861
Deduced a syphon composed of 45 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 117 place count 380 transition count 836
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 121 place count 380 transition count 874
Deduced a syphon composed of 49 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 145 place count 380 transition count 850
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 149 place count 380 transition count 891
Deduced a syphon composed of 53 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 174 place count 380 transition count 866
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 178 place count 380 transition count 906
Deduced a syphon composed of 57 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 204 place count 380 transition count 880
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 208 place count 380 transition count 917
Deduced a syphon composed of 61 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 233 place count 380 transition count 892
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 237 place count 380 transition count 929
Deduced a syphon composed of 65 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 262 place count 380 transition count 904
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 266 place count 380 transition count 941
Deduced a syphon composed of 69 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 291 place count 380 transition count 916
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 295 place count 380 transition count 953
Deduced a syphon composed of 73 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 320 place count 380 transition count 928
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 324 place count 380 transition count 965
Deduced a syphon composed of 77 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 349 place count 380 transition count 940
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 353 place count 380 transition count 977
Deduced a syphon composed of 81 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 378 place count 380 transition count 952
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 382 place count 380 transition count 989
Deduced a syphon composed of 85 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 407 place count 380 transition count 964
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 411 place count 380 transition count 995
Deduced a syphon composed of 89 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 434 place count 380 transition count 972
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 438 place count 380 transition count 1003
Deduced a syphon composed of 93 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 461 place count 380 transition count 980
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 465 place count 380 transition count 1011
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 488 place count 380 transition count 988
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 492 place count 380 transition count 1031
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 496 place count 376 transition count 1023
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 500 place count 376 transition count 1023
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 523 place count 376 transition count 1000
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 527 place count 376 transition count 1037
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 531 place count 372 transition count 1029
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 535 place count 372 transition count 1029
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 558 place count 372 transition count 1006
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 562 place count 372 transition count 1041
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 566 place count 368 transition count 1033
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 570 place count 368 transition count 1033
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 593 place count 368 transition count 1010
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 597 place count 368 transition count 1045
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 601 place count 364 transition count 1037
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 605 place count 364 transition count 1037
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 628 place count 364 transition count 1014
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 632 place count 364 transition count 1049
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 636 place count 360 transition count 1041
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 640 place count 360 transition count 1041
Deduced a syphon composed of 97 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 663 place count 360 transition count 1018
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 667 place count 360 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 670 place count 357 transition count 1046
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 673 place count 357 transition count 1046
Deduced a syphon composed of 98 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 696 place count 357 transition count 1023
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 698 place count 357 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 700 place count 355 transition count 1032
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 702 place count 355 transition count 1032
Deduced a syphon composed of 98 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 709 place count 355 transition count 1025
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 709 rules in 893 ms. Remains 355 /597 variables (removed 242) and now considering 1025/788 (removed -237) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 355/1432 places, 1025/2470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62931 ms. Remains : 355/1432 places, 1025/2470 transitions.
Support contains 2 out of 1432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1432/1432 places, 2470/2470 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1431 transition count 2469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1430 transition count 2468
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1430 transition count 2468
Applied a total of 4 rules in 156 ms. Remains 1430 /1432 variables (removed 2) and now considering 2468/2470 (removed 2) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2024-05-22 07:00:52] [INFO ] Computed 109 invariants in 8 ms
[2024-05-22 07:00:53] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-22 07:00:53] [INFO ] Invariant cache hit.
[2024-05-22 07:00:55] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2561 ms to find 0 implicit places.
Running 2467 sub problems to find dead transitions.
[2024-05-22 07:00:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 2467/2467 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2467 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1429/3898 variables, and 0 constraints, problems are : Problem set: 0 solved, 2467 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1430 constraints, PredecessorRefiner: 0/2467 constraints, Known Traps: 0/0 constraints]
After SMT, in 61051ms problems are : Problem set: 0 solved, 2467 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Starting structural reductions in LTL mode, iteration 1 : 1430/1432 places, 2468/2470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63800 ms. Remains : 1430/1432 places, 2468/2470 transitions.
Treatment of property DLCround-PT-06b-LTLFireability-06 finished in 303503 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(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1322 edges and 1462 vertex of which 385 / 1462 are part of one of the 31 SCC in 0 ms
Free SCC test removed 354 places
Ensure Unique test removed 383 transitions
Reduce isomorphic transitions removed 383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 252 place count 1107 transition count 1883
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 284 rules applied. Total rules applied 536 place count 856 transition count 1850
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 558 place count 834 transition count 1850
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 558 place count 834 transition count 1741
Deduced a syphon composed of 109 places in 5 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 776 place count 725 transition count 1741
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 831 place count 670 transition count 1416
Iterating global reduction 3 with 55 rules applied. Total rules applied 886 place count 670 transition count 1416
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 889 place count 670 transition count 1413
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 889 place count 670 transition count 1410
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 895 place count 667 transition count 1410
Performed 248 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 4 with 496 rules applied. Total rules applied 1391 place count 419 transition count 1156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1398 place count 419 transition count 1149
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1418 place count 399 transition count 964
Iterating global reduction 5 with 20 rules applied. Total rules applied 1438 place count 399 transition count 964
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1457 place count 399 transition count 945
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1491 place count 382 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1495 place count 378 transition count 1017
Iterating global reduction 6 with 4 rules applied. Total rules applied 1499 place count 378 transition count 1017
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1528 place count 378 transition count 988
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1556 place count 378 transition count 960
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1568 place count 366 transition count 936
Iterating global reduction 7 with 12 rules applied. Total rules applied 1580 place count 366 transition count 936
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1592 place count 354 transition count 814
Iterating global reduction 7 with 12 rules applied. Total rules applied 1604 place count 354 transition count 814
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1616 place count 354 transition count 802
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1617 place count 354 transition count 802
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 354 transition count 801
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1619 place count 353 transition count 799
Iterating global reduction 8 with 1 rules applied. Total rules applied 1620 place count 353 transition count 799
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1621 place count 352 transition count 789
Iterating global reduction 8 with 1 rules applied. Total rules applied 1622 place count 352 transition count 789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1623 place count 352 transition count 788
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1624 place count 351 transition count 787
Applied a total of 1624 rules in 274 ms. Remains 351 /1462 variables (removed 1111) and now considering 787/2518 (removed 1731) transitions.
[2024-05-22 07:01:56] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
// Phase 1: matrix 765 rows 351 cols
[2024-05-22 07:01:56] [INFO ] Computed 109 invariants in 2 ms
[2024-05-22 07:01:56] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-22 07:01:56] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
[2024-05-22 07:01:56] [INFO ] Invariant cache hit.
[2024-05-22 07:01:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 07:01:57] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-05-22 07:01:57] [INFO ] Redundant transitions in 13 ms returned []
Running 725 sub problems to find dead transitions.
[2024-05-22 07:01:57] [INFO ] Flow matrix only has 765 transitions (discarded 22 similar events)
[2024-05-22 07:01:57] [INFO ] Invariant cache hit.
[2024-05-22 07:01:57] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/351 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 764/1115 variables, 351/460 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1115 variables, 40/500 constraints. Problems are: Problem set: 0 solved, 725 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 1115/1116 variables, and 500 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 351/351 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (OVERLAPS) 1/351 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 4 (OVERLAPS) 764/1115 variables, 351/460 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1115 variables, 40/500 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 725/1225 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1116 variables, and 1225 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 351/351 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1462 places, 787/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61612 ms. Remains : 351/1462 places, 787/2518 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-07
Stuttering criterion allowed to conclude after 1487 steps with 0 reset in 20 ms.
FORMULA DLCround-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-07 finished in 61734 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)&&G(p1)))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 577 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 07:02:58] [INFO ] Computed 109 invariants in 7 ms
[2024-05-22 07:02:59] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-22 07:02:59] [INFO ] Invariant cache hit.
[2024-05-22 07:03:01] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2602 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2024-05-22 07:03:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints]
After SMT, in 61063ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 61090ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64274 ms. Remains : 1431/1462 places, 2469/2518 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 5224 steps with 0 reset in 26 ms.
FORMULA DLCround-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-08 finished in 64497 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((F(G(p0))&&F(p1))))'
Support contains 3 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1322 edges and 1462 vertex of which 375 / 1462 are part of one of the 33 SCC in 1 ms
Free SCC test removed 342 places
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 1119 transition count 1896
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 286 rules applied. Total rules applied 540 place count 866 transition count 1863
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 562 place count 844 transition count 1863
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 562 place count 844 transition count 1752
Deduced a syphon composed of 111 places in 6 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 784 place count 733 transition count 1752
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 837 place count 680 transition count 1429
Iterating global reduction 3 with 53 rules applied. Total rules applied 890 place count 680 transition count 1429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 893 place count 680 transition count 1426
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 893 place count 680 transition count 1423
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 899 place count 677 transition count 1423
Performed 254 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 254 places in 0 ms
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 4 with 508 rules applied. Total rules applied 1407 place count 423 transition count 1162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1414 place count 423 transition count 1155
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1432 place count 405 transition count 990
Iterating global reduction 5 with 18 rules applied. Total rules applied 1450 place count 405 transition count 990
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1466 place count 405 transition count 974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1468 place count 404 transition count 973
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1502 place count 387 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1503 place count 387 transition count 1108
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1507 place count 383 transition count 1046
Iterating global reduction 7 with 4 rules applied. Total rules applied 1511 place count 383 transition count 1046
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1540 place count 383 transition count 1017
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 1568 place count 383 transition count 989
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1580 place count 371 transition count 965
Iterating global reduction 8 with 12 rules applied. Total rules applied 1592 place count 371 transition count 965
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1604 place count 359 transition count 843
Iterating global reduction 8 with 12 rules applied. Total rules applied 1616 place count 359 transition count 843
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1628 place count 359 transition count 831
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1629 place count 358 transition count 830
Applied a total of 1629 rules in 223 ms. Remains 358 /1462 variables (removed 1104) and now considering 830/2518 (removed 1688) transitions.
[2024-05-22 07:04:02] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
// Phase 1: matrix 805 rows 358 cols
[2024-05-22 07:04:02] [INFO ] Computed 109 invariants in 24 ms
[2024-05-22 07:04:03] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 07:04:03] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
[2024-05-22 07:04:03] [INFO ] Invariant cache hit.
[2024-05-22 07:04:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 07:04:03] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2024-05-22 07:04:03] [INFO ] Redundant transitions in 12 ms returned []
Running 772 sub problems to find dead transitions.
[2024-05-22 07:04:03] [INFO ] Flow matrix only has 805 transitions (discarded 25 similar events)
[2024-05-22 07:04:03] [INFO ] Invariant cache hit.
[2024-05-22 07:04:03] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (OVERLAPS) 2/358 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (OVERLAPS) 804/1162 variables, 358/467 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1162 variables, 50/517 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1162/1163 variables, and 517 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 358/358 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 772/772 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 772 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (OVERLAPS) 2/358 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (OVERLAPS) 804/1162 variables, 358/467 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1162 variables, 50/517 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1162 variables, 772/1289 constraints. Problems are: Problem set: 0 solved, 772 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 1162/1163 variables, and 1289 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 358/358 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 772/772 constraints, Known Traps: 0/0 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 772 unsolved
Search for dead transitions found 0 dead transitions in 60551ms
Starting structural reductions in SI_LTL mode, iteration 1 : 358/1462 places, 830/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61730 ms. Remains : 358/1462 places, 830/2518 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-09
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-09 finished in 61871 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(F(p0)))'
Support contains 1 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1325 edges and 1462 vertex of which 391 / 1462 are part of one of the 32 SCC in 1 ms
Free SCC test removed 359 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 250 place count 1102 transition count 1880
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 282 rules applied. Total rules applied 532 place count 853 transition count 1847
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 554 place count 831 transition count 1847
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 554 place count 831 transition count 1739
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 770 place count 723 transition count 1739
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 826 place count 667 transition count 1404
Iterating global reduction 3 with 56 rules applied. Total rules applied 882 place count 667 transition count 1404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 885 place count 667 transition count 1401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 885 place count 667 transition count 1398
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 891 place count 664 transition count 1398
Performed 247 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 247 places in 1 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 4 with 494 rules applied. Total rules applied 1385 place count 417 transition count 1144
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1392 place count 417 transition count 1137
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1412 place count 397 transition count 952
Iterating global reduction 5 with 20 rules applied. Total rules applied 1432 place count 397 transition count 952
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1451 place count 397 transition count 933
Performed 21 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1493 place count 376 transition count 1094
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1497 place count 372 transition count 1032
Iterating global reduction 6 with 4 rules applied. Total rules applied 1501 place count 372 transition count 1032
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1530 place count 372 transition count 1003
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 1570 place count 372 transition count 963
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1584 place count 358 transition count 935
Iterating global reduction 7 with 14 rules applied. Total rules applied 1598 place count 358 transition count 935
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1612 place count 344 transition count 783
Iterating global reduction 7 with 14 rules applied. Total rules applied 1626 place count 344 transition count 783
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1640 place count 344 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1641 place count 343 transition count 768
Applied a total of 1641 rules in 192 ms. Remains 343 /1462 variables (removed 1119) and now considering 768/2518 (removed 1750) transitions.
[2024-05-22 07:05:04] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
// Phase 1: matrix 736 rows 343 cols
[2024-05-22 07:05:04] [INFO ] Computed 109 invariants in 3 ms
[2024-05-22 07:05:05] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-22 07:05:05] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
[2024-05-22 07:05:05] [INFO ] Invariant cache hit.
[2024-05-22 07:05:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:05:05] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2024-05-22 07:05:05] [INFO ] Redundant transitions in 12 ms returned []
Running 708 sub problems to find dead transitions.
[2024-05-22 07:05:05] [INFO ] Flow matrix only has 736 transitions (discarded 32 similar events)
[2024-05-22 07:05:05] [INFO ] Invariant cache hit.
[2024-05-22 07:05:05] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 708 unsolved
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 735/1078 variables, 343/454 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 45/499 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1078/1079 variables, and 499 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 343/343 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (OVERLAPS) 1/343 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 735/1078 variables, 343/454 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 45/499 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1078 variables, 708/1207 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1078/1079 variables, and 1207 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 343/343 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 2/2 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in SI_LTL mode, iteration 1 : 343/1462 places, 768/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61692 ms. Remains : 343/1462 places, 768/2518 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-10 finished in 61787 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((G(F(p0)) U (p1 U X(p2)))))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 1445 transition count 2483
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1443 transition count 2481
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1441 transition count 2479
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1439 transition count 2477
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1439 transition count 2477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 1437 transition count 2475
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 1437 transition count 2475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1435 transition count 2473
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1435 transition count 2473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1433 transition count 2471
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1433 transition count 2471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1432 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1432 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1431 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1431 transition count 2469
Applied a total of 62 rules in 650 ms. Remains 1431 /1462 variables (removed 31) and now considering 2469/2518 (removed 49) transitions.
// Phase 1: matrix 2469 rows 1431 cols
[2024-05-22 07:06:06] [INFO ] Computed 109 invariants in 7 ms
[2024-05-22 07:06:07] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-22 07:06:07] [INFO ] Invariant cache hit.
[2024-05-22 07:06:09] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
Running 2468 sub problems to find dead transitions.
[2024-05-22 07:06:09] [INFO ] Invariant cache hit.
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 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 2468/2468 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1430/3900 variables, and 0 constraints, problems are : Problem set: 0 solved, 2468 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1431 constraints, PredecessorRefiner: 0/2468 constraints, Known Traps: 0/0 constraints]
After SMT, in 61078ms problems are : Problem set: 0 solved, 2468 unsolved
Search for dead transitions found 0 dead transitions in 61104ms
Starting structural reductions in LTL mode, iteration 1 : 1431/1462 places, 2469/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64314 ms. Remains : 1431/1462 places, 2469/2518 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-12
Product exploration explored 100000 steps with 17 reset in 574 ms.
Product exploration explored 100000 steps with 11 reset in 831 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 456 ms. (87 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-22 07:07:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1344/1431 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2469/3900 variables, 1431/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3900 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3900/3900 variables, and 1540 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1344/1431 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1431 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2469/3900 variables, 1431/1540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3900 variables, 1/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3900 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3900 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3900/3900 variables, and 1541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 1431/1431 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2812ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 279 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 319 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
[2024-05-22 07:07:16] [INFO ] Invariant cache hit.
[2024-05-22 07:07:18] [INFO ] [Real]Absence check using 109 positive place invariants in 8 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 11 factoid took 365 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-06b-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLFireability-12 finished in 72349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(!p1)) U p2)))'
Support contains 4 out of 1462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Graph (trivial) has 1320 edges and 1462 vertex of which 385 / 1462 are part of one of the 32 SCC in 1 ms
Free SCC test removed 353 places
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 1108 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 280 rules applied. Total rules applied 528 place count 861 transition count 1857
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 550 place count 839 transition count 1857
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 550 place count 839 transition count 1746
Deduced a syphon composed of 111 places in 6 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 772 place count 728 transition count 1746
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 825 place count 675 transition count 1423
Iterating global reduction 3 with 53 rules applied. Total rules applied 878 place count 675 transition count 1423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 881 place count 675 transition count 1420
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 881 place count 675 transition count 1417
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 887 place count 672 transition count 1417
Performed 250 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 4 with 500 rules applied. Total rules applied 1387 place count 422 transition count 1160
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1395 place count 422 transition count 1152
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1414 place count 403 transition count 974
Iterating global reduction 5 with 19 rules applied. Total rules applied 1433 place count 403 transition count 974
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1451 place count 403 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1453 place count 402 transition count 955
Performed 17 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1487 place count 385 transition count 1086
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1491 place count 381 transition count 1024
Iterating global reduction 6 with 4 rules applied. Total rules applied 1495 place count 381 transition count 1024
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1524 place count 381 transition count 995
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 1552 place count 381 transition count 967
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1565 place count 368 transition count 941
Iterating global reduction 7 with 13 rules applied. Total rules applied 1578 place count 368 transition count 941
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1591 place count 355 transition count 809
Iterating global reduction 7 with 13 rules applied. Total rules applied 1604 place count 355 transition count 809
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1617 place count 355 transition count 796
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1618 place count 354 transition count 795
Applied a total of 1618 rules in 215 ms. Remains 354 /1462 variables (removed 1108) and now considering 795/2518 (removed 1723) transitions.
[2024-05-22 07:07:18] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
// Phase 1: matrix 765 rows 354 cols
[2024-05-22 07:07:18] [INFO ] Computed 109 invariants in 2 ms
[2024-05-22 07:07:19] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-22 07:07:19] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2024-05-22 07:07:19] [INFO ] Invariant cache hit.
[2024-05-22 07:07:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 07:07:19] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-05-22 07:07:19] [INFO ] Redundant transitions in 14 ms returned []
Running 732 sub problems to find dead transitions.
[2024-05-22 07:07:19] [INFO ] Flow matrix only has 765 transitions (discarded 30 similar events)
[2024-05-22 07:07:19] [INFO ] Invariant cache hit.
[2024-05-22 07:07:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 764/1118 variables, 354/463 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 40/503 constraints. Problems are: Problem set: 0 solved, 732 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 1118/1119 variables, and 503 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 354/354 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 4 (OVERLAPS) 764/1118 variables, 354/463 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 40/503 constraints. Problems are: Problem set: 0 solved, 732 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 732/1235 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/1119 variables, and 1235 constraints, problems are : Problem set: 0 solved, 732 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 354/354 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 0/0 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 732 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Starting structural reductions in SI_LTL mode, iteration 1 : 354/1462 places, 795/2518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61710 ms. Remains : 354/1462 places, 795/2518 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-13 finished in 61884 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(((p0 U p1)&&F(X(p2))&&(!(p0 U p3)||p3))))'
Support contains 6 out of 1462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1462/1462 places, 2518/2518 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1451 transition count 2489
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1451 transition count 2489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1446 transition count 2484
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1446 transition count 2484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1445 transition count 2483
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1445 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1444 transition count 2482
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1444 transition count 2482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1443 transition count 2481
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1443 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1442 transition count 2480
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1442 transition count 2480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1441 transition count 2479
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1441 transition count 2479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1440 transition count 2478
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1440 transition count 2478
Applied a total of 44 rules in 540 ms. Remains 1440 /1462 variables (removed 22) and now considering 2478/2518 (removed 40) transitions.
// Phase 1: matrix 2478 rows 1440 cols
[2024-05-22 07:08:21] [INFO ] Computed 109 invariants in 7 ms
[2024-05-22 07:08:21] [INFO ] Implicit Places using invariants in 734 ms returned []
[2024-05-22 07:08:21] [INFO ] Invariant cache hit.
[2024-05-22 07:08:23] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
Running 2477 sub problems to find dead transitions.
[2024-05-22 07:08:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 2477/2477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1439/3918 variables, and 0 constraints, problems are : Problem set: 0 solved, 2477 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/109 constraints, State Equation: 0/1440 constraints, PredecessorRefiner: 0/2477 constraints, Known Traps: 0/0 constraints]
After SMT, in 61162ms problems are : Problem set: 0 solved, 2477 unsolved
Search for dead transitions found 0 dead transitions in 61198ms
Starting structural reductions in LTL mode, iteration 1 : 1440/1462 places, 2478/2518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64522 ms. Remains : 1440/1462 places, 2478/2518 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, p3, (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-06b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLFireability-15 finished in 64953 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(p0)&&F(p1))||(X(F(p3))&&p2))))'
[2024-05-22 07:09:25] [INFO ] Flatten gal took : 97 ms
[2024-05-22 07:09:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 07:09:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1462 places, 2518 transitions and 7312 arcs took 25 ms.
Total runtime 1321947 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DLCround-PT-06b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1462
TRANSITIONS: 2518
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.056s, Sys 0.010s]
SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.013s, 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: 2360
MODEL NAME: /home/mcc/execution/407/model
1462 places, 2518 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
MEDDLY ERROR: Insufficient memory
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="DLCround-PT-06b"
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 DLCround-PT-06b, 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 r113-smll-171624274400172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06b.tgz
mv DLCround-PT-06b 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 ;