About the Execution of GreatSPN+red for Anderson-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9893.884 | 3600000.00 | 12933113.00 | 2091.20 | FFFTTFFF?FFFFFFF | 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.r003-smll-171620117600364.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 Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K 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 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716453573056
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 08:39:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 08:39:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 08:39:35] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-05-23 08:39:35] [INFO ] Transformed 621 places.
[2024-05-23 08:39:35] [INFO ] Transformed 2480 transitions.
[2024-05-23 08:39:35] [INFO ] Found NUPN structural information;
[2024-05-23 08:39:35] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 467 transition count 1120
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 467 transition count 1120
Applied a total of 308 rules in 152 ms. Remains 467 /621 variables (removed 154) and now considering 1120/2480 (removed 1360) transitions.
// Phase 1: matrix 1120 rows 467 cols
[2024-05-23 08:39:36] [INFO ] Computed 23 invariants in 80 ms
[2024-05-23 08:39:36] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-23 08:39:36] [INFO ] Invariant cache hit.
[2024-05-23 08:39:37] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:39:41] [INFO ] Implicit Places using invariants and state equation in 4593 ms returned []
Implicit Place search using SMT with State Equation took 5529 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-23 08:39:41] [INFO ] Invariant cache hit.
[2024-05-23 08:39:41] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-23 08:39:58] [INFO ] Deduced a trap composed of 200 places in 673 ms of which 53 ms to minimize.
[2024-05-23 08:39:59] [INFO ] Deduced a trap composed of 163 places in 524 ms of which 6 ms to minimize.
[2024-05-23 08:39:59] [INFO ] Deduced a trap composed of 161 places in 420 ms of which 6 ms to minimize.
[2024-05-23 08:40:00] [INFO ] Deduced a trap composed of 207 places in 655 ms of which 9 ms to minimize.
[2024-05-23 08:40:01] [INFO ] Deduced a trap composed of 211 places in 522 ms of which 5 ms to minimize.
[2024-05-23 08:40:02] [INFO ] Deduced a trap composed of 275 places in 1127 ms of which 11 ms to minimize.
[2024-05-23 08:40:03] [INFO ] Deduced a trap composed of 203 places in 415 ms of which 5 ms to minimize.
[2024-05-23 08:40:03] [INFO ] Deduced a trap composed of 290 places in 520 ms of which 5 ms to minimize.
[2024-05-23 08:40:04] [INFO ] Deduced a trap composed of 215 places in 432 ms of which 5 ms to minimize.
[2024-05-23 08:40:04] [INFO ] Deduced a trap composed of 319 places in 563 ms of which 8 ms to minimize.
[2024-05-23 08:40:05] [INFO ] Deduced a trap composed of 88 places in 499 ms of which 7 ms to minimize.
[2024-05-23 08:40:05] [INFO ] Deduced a trap composed of 284 places in 562 ms of which 7 ms to minimize.
[2024-05-23 08:40:06] [INFO ] Deduced a trap composed of 191 places in 516 ms of which 5 ms to minimize.
[2024-05-23 08:40:06] [INFO ] Deduced a trap composed of 117 places in 350 ms of which 4 ms to minimize.
[2024-05-23 08:40:07] [INFO ] Deduced a trap composed of 269 places in 533 ms of which 5 ms to minimize.
[2024-05-23 08:40:07] [INFO ] Deduced a trap composed of 116 places in 432 ms of which 6 ms to minimize.
[2024-05-23 08:40:08] [INFO ] Deduced a trap composed of 265 places in 546 ms of which 7 ms to minimize.
[2024-05-23 08:40:08] [INFO ] Deduced a trap composed of 203 places in 479 ms of which 5 ms to minimize.
[2024-05-23 08:40:09] [INFO ] Deduced a trap composed of 114 places in 569 ms of which 7 ms to minimize.
[2024-05-23 08:40:09] [INFO ] Deduced a trap composed of 269 places in 474 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-23 08:40:11] [INFO ] Deduced a trap composed of 166 places in 388 ms of which 5 ms to minimize.
[2024-05-23 08:40:12] [INFO ] Deduced a trap composed of 110 places in 472 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1587 variables, and 45 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/467 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 22/45 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-23 08:40:18] [INFO ] Deduced a trap composed of 181 places in 523 ms of which 6 ms to minimize.
[2024-05-23 08:40:18] [INFO ] Deduced a trap composed of 147 places in 460 ms of which 5 ms to minimize.
[2024-05-23 08:40:19] [INFO ] Deduced a trap composed of 111 places in 398 ms of which 7 ms to minimize.
[2024-05-23 08:40:19] [INFO ] Deduced a trap composed of 109 places in 435 ms of which 5 ms to minimize.
[2024-05-23 08:40:20] [INFO ] Deduced a trap composed of 175 places in 546 ms of which 7 ms to minimize.
[2024-05-23 08:40:20] [INFO ] Deduced a trap composed of 114 places in 548 ms of which 6 ms to minimize.
[2024-05-23 08:40:21] [INFO ] Deduced a trap composed of 121 places in 499 ms of which 4 ms to minimize.
[2024-05-23 08:40:21] [INFO ] Deduced a trap composed of 119 places in 546 ms of which 5 ms to minimize.
[2024-05-23 08:40:22] [INFO ] Deduced a trap composed of 116 places in 530 ms of which 4 ms to minimize.
[2024-05-23 08:40:23] [INFO ] Deduced a trap composed of 121 places in 537 ms of which 7 ms to minimize.
[2024-05-23 08:40:23] [INFO ] Deduced a trap composed of 119 places in 522 ms of which 7 ms to minimize.
[2024-05-23 08:40:24] [INFO ] Deduced a trap composed of 139 places in 450 ms of which 4 ms to minimize.
[2024-05-23 08:40:24] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 5 ms to minimize.
[2024-05-23 08:40:25] [INFO ] Deduced a trap composed of 102 places in 508 ms of which 5 ms to minimize.
[2024-05-23 08:40:25] [INFO ] Deduced a trap composed of 292 places in 538 ms of which 5 ms to minimize.
[2024-05-23 08:40:26] [INFO ] Deduced a trap composed of 157 places in 596 ms of which 5 ms to minimize.
[2024-05-23 08:40:26] [INFO ] Deduced a trap composed of 159 places in 442 ms of which 5 ms to minimize.
[2024-05-23 08:40:27] [INFO ] Deduced a trap composed of 159 places in 446 ms of which 5 ms to minimize.
[2024-05-23 08:40:28] [INFO ] Deduced a trap composed of 186 places in 577 ms of which 8 ms to minimize.
[2024-05-23 08:40:28] [INFO ] Deduced a trap composed of 220 places in 413 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-23 08:40:32] [INFO ] Deduced a trap composed of 109 places in 436 ms of which 5 ms to minimize.
[2024-05-23 08:40:33] [INFO ] Deduced a trap composed of 115 places in 533 ms of which 6 ms to minimize.
[2024-05-23 08:40:33] [INFO ] Deduced a trap composed of 243 places in 536 ms of which 5 ms to minimize.
[2024-05-23 08:40:34] [INFO ] Deduced a trap composed of 169 places in 554 ms of which 5 ms to minimize.
[2024-05-23 08:40:35] [INFO ] Deduced a trap composed of 207 places in 535 ms of which 5 ms to minimize.
[2024-05-23 08:40:35] [INFO ] Deduced a trap composed of 257 places in 527 ms of which 6 ms to minimize.
[2024-05-23 08:40:36] [INFO ] Deduced a trap composed of 183 places in 530 ms of which 7 ms to minimize.
[2024-05-23 08:40:36] [INFO ] Deduced a trap composed of 178 places in 551 ms of which 6 ms to minimize.
[2024-05-23 08:40:37] [INFO ] Deduced a trap composed of 173 places in 530 ms of which 5 ms to minimize.
[2024-05-23 08:40:37] [INFO ] Deduced a trap composed of 138 places in 458 ms of which 5 ms to minimize.
[2024-05-23 08:40:38] [INFO ] Deduced a trap composed of 91 places in 584 ms of which 6 ms to minimize.
[2024-05-23 08:40:38] [INFO ] Deduced a trap composed of 221 places in 558 ms of which 7 ms to minimize.
[2024-05-23 08:40:39] [INFO ] Deduced a trap composed of 112 places in 498 ms of which 5 ms to minimize.
[2024-05-23 08:40:40] [INFO ] Deduced a trap composed of 119 places in 462 ms of which 5 ms to minimize.
[2024-05-23 08:40:40] [INFO ] Deduced a trap composed of 127 places in 573 ms of which 7 ms to minimize.
[2024-05-23 08:40:41] [INFO ] Deduced a trap composed of 219 places in 549 ms of which 7 ms to minimize.
[2024-05-23 08:40:41] [INFO ] Deduced a trap composed of 183 places in 503 ms of which 7 ms to minimize.
[2024-05-23 08:40:42] [INFO ] Deduced a trap composed of 204 places in 510 ms of which 7 ms to minimize.
[2024-05-23 08:40:42] [INFO ] Deduced a trap composed of 114 places in 476 ms of which 4 ms to minimize.
[2024-05-23 08:40:43] [INFO ] Deduced a trap composed of 130 places in 525 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/1587 variables, and 85 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/467 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 62/62 constraints]
After SMT, in 62576ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 62636ms
Starting structural reductions in LTL mode, iteration 1 : 467/621 places, 1120/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68361 ms. Remains : 467/621 places, 1120/2480 transitions.
Support contains 50 out of 467 places after structural reductions.
[2024-05-23 08:40:44] [INFO ] Flatten gal took : 178 ms
[2024-05-23 08:40:44] [INFO ] Flatten gal took : 114 ms
[2024-05-23 08:40:44] [INFO ] Input system was already deterministic with 1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 2294 ms. (17 steps per ms) remains 24/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
[2024-05-23 08:40:46] [INFO ] Invariant cache hit.
[2024-05-23 08:40:46] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 372/404 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 20/424 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 34/458 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 9/467 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-23 08:40:47] [INFO ] Deduced a trap composed of 155 places in 540 ms of which 5 ms to minimize.
[2024-05-23 08:40:48] [INFO ] Deduced a trap composed of 92 places in 534 ms of which 5 ms to minimize.
[2024-05-23 08:40:48] [INFO ] Deduced a trap composed of 211 places in 377 ms of which 5 ms to minimize.
[2024-05-23 08:40:48] [INFO ] Deduced a trap composed of 163 places in 500 ms of which 5 ms to minimize.
[2024-05-23 08:40:49] [INFO ] Deduced a trap composed of 143 places in 516 ms of which 5 ms to minimize.
[2024-05-23 08:40:50] [INFO ] Deduced a trap composed of 135 places in 527 ms of which 5 ms to minimize.
[2024-05-23 08:40:50] [INFO ] Deduced a trap composed of 62 places in 580 ms of which 7 ms to minimize.
[2024-05-23 08:40:51] [INFO ] Deduced a trap composed of 149 places in 483 ms of which 5 ms to minimize.
SMT process timed out in 5281ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 88 Pre rules applied. Total rules applied 0 place count 467 transition count 1032
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 379 transition count 1032
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 184 place count 371 transition count 898
Iterating global reduction 0 with 8 rules applied. Total rules applied 192 place count 371 transition count 898
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 196 place count 369 transition count 896
Applied a total of 196 rules in 165 ms. Remains 369 /467 variables (removed 98) and now considering 896/1120 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 369/467 places, 896/1120 transitions.
RANDOM walk for 40000 steps (8 resets) in 653 ms. (61 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 14/14 properties
// Phase 1: matrix 896 rows 369 cols
[2024-05-23 08:40:52] [INFO ] Computed 23 invariants in 20 ms
[2024-05-23 08:40:52] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 322/350 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 12/362 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 7/369 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:40:52] [INFO ] Deduced a trap composed of 149 places in 282 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:40:53] [INFO ] Deduced a trap composed of 103 places in 389 ms of which 5 ms to minimize.
[2024-05-23 08:40:53] [INFO ] Deduced a trap composed of 138 places in 402 ms of which 4 ms to minimize.
[2024-05-23 08:40:54] [INFO ] Deduced a trap composed of 109 places in 341 ms of which 4 ms to minimize.
[2024-05-23 08:40:54] [INFO ] Deduced a trap composed of 193 places in 427 ms of which 4 ms to minimize.
[2024-05-23 08:40:55] [INFO ] Deduced a trap composed of 101 places in 412 ms of which 4 ms to minimize.
[2024-05-23 08:40:55] [INFO ] Deduced a trap composed of 172 places in 423 ms of which 4 ms to minimize.
[2024-05-23 08:40:56] [INFO ] Deduced a trap composed of 176 places in 440 ms of which 6 ms to minimize.
[2024-05-23 08:40:56] [INFO ] Deduced a trap composed of 149 places in 380 ms of which 4 ms to minimize.
[2024-05-23 08:40:56] [INFO ] Deduced a trap composed of 85 places in 455 ms of which 6 ms to minimize.
[2024-05-23 08:40:57] [INFO ] Deduced a trap composed of 176 places in 397 ms of which 4 ms to minimize.
[2024-05-23 08:40:57] [INFO ] Deduced a trap composed of 120 places in 391 ms of which 4 ms to minimize.
[2024-05-23 08:40:58] [INFO ] Deduced a trap composed of 179 places in 468 ms of which 6 ms to minimize.
[2024-05-23 08:40:58] [INFO ] Deduced a trap composed of 75 places in 394 ms of which 4 ms to minimize.
[2024-05-23 08:40:59] [INFO ] Deduced a trap composed of 79 places in 397 ms of which 4 ms to minimize.
[2024-05-23 08:40:59] [INFO ] Deduced a trap composed of 232 places in 352 ms of which 4 ms to minimize.
[2024-05-23 08:40:59] [INFO ] Deduced a trap composed of 127 places in 370 ms of which 5 ms to minimize.
[2024-05-23 08:41:00] [INFO ] Deduced a trap composed of 75 places in 386 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:00] [INFO ] Deduced a trap composed of 98 places in 459 ms of which 6 ms to minimize.
[2024-05-23 08:41:01] [INFO ] Deduced a trap composed of 155 places in 454 ms of which 5 ms to minimize.
[2024-05-23 08:41:01] [INFO ] Deduced a trap composed of 169 places in 441 ms of which 6 ms to minimize.
[2024-05-23 08:41:02] [INFO ] Deduced a trap composed of 64 places in 453 ms of which 6 ms to minimize.
[2024-05-23 08:41:02] [INFO ] Deduced a trap composed of 112 places in 475 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:03] [INFO ] Deduced a trap composed of 221 places in 360 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:03] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:04] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:05] [INFO ] Deduced a trap composed of 155 places in 378 ms of which 5 ms to minimize.
[2024-05-23 08:41:05] [INFO ] Deduced a trap composed of 166 places in 341 ms of which 4 ms to minimize.
[2024-05-23 08:41:06] [INFO ] Deduced a trap composed of 128 places in 347 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 08:41:07] [INFO ] Deduced a trap composed of 115 places in 334 ms of which 4 ms to minimize.
[2024-05-23 08:41:07] [INFO ] Deduced a trap composed of 93 places in 477 ms of which 4 ms to minimize.
[2024-05-23 08:41:07] [INFO ] Deduced a trap composed of 195 places in 326 ms of which 4 ms to minimize.
[2024-05-23 08:41:08] [INFO ] Deduced a trap composed of 145 places in 321 ms of which 4 ms to minimize.
[2024-05-23 08:41:08] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 896/1265 variables, 369/426 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1265 variables, 90/516 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1265 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/1265 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1265/1265 variables, and 516 constraints, problems are : Problem set: 0 solved, 14 unsolved in 19475 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 369/369 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 322/350 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 12/362 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 6 (OVERLAPS) 7/369 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 34/57 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:12] [INFO ] Deduced a trap composed of 69 places in 437 ms of which 4 ms to minimize.
[2024-05-23 08:41:13] [INFO ] Deduced a trap composed of 108 places in 452 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:13] [INFO ] Deduced a trap composed of 166 places in 422 ms of which 6 ms to minimize.
[2024-05-23 08:41:14] [INFO ] Deduced a trap composed of 73 places in 367 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:14] [INFO ] Deduced a trap composed of 195 places in 371 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:15] [INFO ] Deduced a trap composed of 177 places in 437 ms of which 4 ms to minimize.
[2024-05-23 08:41:16] [INFO ] Deduced a trap composed of 185 places in 313 ms of which 4 ms to minimize.
[2024-05-23 08:41:16] [INFO ] Deduced a trap composed of 214 places in 346 ms of which 3 ms to minimize.
[2024-05-23 08:41:16] [INFO ] Deduced a trap composed of 216 places in 343 ms of which 4 ms to minimize.
[2024-05-23 08:41:17] [INFO ] Deduced a trap composed of 211 places in 359 ms of which 4 ms to minimize.
[2024-05-23 08:41:17] [INFO ] Deduced a trap composed of 182 places in 349 ms of which 4 ms to minimize.
[2024-05-23 08:41:18] [INFO ] Deduced a trap composed of 155 places in 370 ms of which 4 ms to minimize.
[2024-05-23 08:41:18] [INFO ] Deduced a trap composed of 152 places in 347 ms of which 4 ms to minimize.
[2024-05-23 08:41:18] [INFO ] Deduced a trap composed of 199 places in 344 ms of which 4 ms to minimize.
[2024-05-23 08:41:19] [INFO ] Deduced a trap composed of 230 places in 373 ms of which 4 ms to minimize.
[2024-05-23 08:41:19] [INFO ] Deduced a trap composed of 219 places in 433 ms of which 6 ms to minimize.
[2024-05-23 08:41:20] [INFO ] Deduced a trap composed of 163 places in 410 ms of which 5 ms to minimize.
[2024-05-23 08:41:20] [INFO ] Deduced a trap composed of 96 places in 378 ms of which 4 ms to minimize.
[2024-05-23 08:41:21] [INFO ] Deduced a trap composed of 137 places in 346 ms of which 4 ms to minimize.
[2024-05-23 08:41:21] [INFO ] Deduced a trap composed of 124 places in 441 ms of which 6 ms to minimize.
[2024-05-23 08:41:22] [INFO ] Deduced a trap composed of 191 places in 414 ms of which 6 ms to minimize.
[2024-05-23 08:41:22] [INFO ] Deduced a trap composed of 251 places in 420 ms of which 4 ms to minimize.
[2024-05-23 08:41:23] [INFO ] Deduced a trap composed of 173 places in 436 ms of which 4 ms to minimize.
[2024-05-23 08:41:23] [INFO ] Deduced a trap composed of 220 places in 399 ms of which 4 ms to minimize.
[2024-05-23 08:41:24] [INFO ] Deduced a trap composed of 152 places in 416 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 20/82 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:24] [INFO ] Deduced a trap composed of 181 places in 404 ms of which 4 ms to minimize.
[2024-05-23 08:41:25] [INFO ] Deduced a trap composed of 140 places in 394 ms of which 5 ms to minimize.
[2024-05-23 08:41:25] [INFO ] Deduced a trap composed of 102 places in 423 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-23 08:41:26] [INFO ] Deduced a trap composed of 85 places in 450 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 896/1265 variables, 369/455 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1265 variables, 90/545 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1265 variables, 13/558 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1265 variables, 0/558 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/1265 variables, 0/558 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1265/1265 variables, and 558 constraints, problems are : Problem set: 1 solved, 13 unsolved in 30299 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 369/369 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 63/63 constraints]
After SMT, in 49845ms problems are : Problem set: 1 solved, 13 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 24 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 896/896 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 365 transition count 820
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 365 transition count 820
Applied a total of 8 rules in 52 ms. Remains 365 /369 variables (removed 4) and now considering 820/896 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 365/369 places, 820/896 transitions.
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
// Phase 1: matrix 820 rows 365 cols
[2024-05-23 08:41:42] [INFO ] Computed 23 invariants in 18 ms
[2024-05-23 08:41:42] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 326/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/355 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 10/365 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:43] [INFO ] Deduced a trap composed of 161 places in 362 ms of which 4 ms to minimize.
[2024-05-23 08:41:43] [INFO ] Deduced a trap composed of 176 places in 352 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:44] [INFO ] Deduced a trap composed of 118 places in 442 ms of which 6 ms to minimize.
[2024-05-23 08:41:44] [INFO ] Deduced a trap composed of 84 places in 449 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 820/1185 variables, 365/392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1185 variables, 90/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1185 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1185 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 482 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3325 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 365/365 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 326/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/355 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:46] [INFO ] Deduced a trap composed of 305 places in 327 ms of which 3 ms to minimize.
[2024-05-23 08:41:47] [INFO ] Deduced a trap composed of 301 places in 284 ms of which 3 ms to minimize.
[2024-05-23 08:41:47] [INFO ] Deduced a trap composed of 280 places in 282 ms of which 3 ms to minimize.
[2024-05-23 08:41:47] [INFO ] Deduced a trap composed of 265 places in 302 ms of which 4 ms to minimize.
[2024-05-23 08:41:48] [INFO ] Deduced a trap composed of 310 places in 325 ms of which 4 ms to minimize.
[2024-05-23 08:41:48] [INFO ] Deduced a trap composed of 271 places in 281 ms of which 5 ms to minimize.
[2024-05-23 08:41:48] [INFO ] Deduced a trap composed of 246 places in 273 ms of which 4 ms to minimize.
[2024-05-23 08:41:48] [INFO ] Deduced a trap composed of 257 places in 268 ms of which 4 ms to minimize.
[2024-05-23 08:41:49] [INFO ] Deduced a trap composed of 241 places in 248 ms of which 3 ms to minimize.
[2024-05-23 08:41:49] [INFO ] Deduced a trap composed of 276 places in 278 ms of which 4 ms to minimize.
[2024-05-23 08:41:49] [INFO ] Deduced a trap composed of 252 places in 278 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 10/365 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:50] [INFO ] Deduced a trap composed of 115 places in 383 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:51] [INFO ] Deduced a trap composed of 102 places in 367 ms of which 4 ms to minimize.
[2024-05-23 08:41:51] [INFO ] Deduced a trap composed of 96 places in 345 ms of which 4 ms to minimize.
[2024-05-23 08:41:51] [INFO ] Deduced a trap composed of 122 places in 339 ms of which 4 ms to minimize.
[2024-05-23 08:41:52] [INFO ] Deduced a trap composed of 160 places in 350 ms of which 4 ms to minimize.
[2024-05-23 08:41:52] [INFO ] Deduced a trap composed of 60 places in 348 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:41:53] [INFO ] Deduced a trap composed of 210 places in 428 ms of which 5 ms to minimize.
[2024-05-23 08:41:53] [INFO ] Deduced a trap composed of 229 places in 342 ms of which 4 ms to minimize.
[2024-05-23 08:41:54] [INFO ] Deduced a trap composed of 126 places in 321 ms of which 4 ms to minimize.
[2024-05-23 08:41:54] [INFO ] Deduced a trap composed of 202 places in 346 ms of which 4 ms to minimize.
[2024-05-23 08:41:54] [INFO ] Deduced a trap composed of 181 places in 437 ms of which 4 ms to minimize.
[2024-05-23 08:41:55] [INFO ] Deduced a trap composed of 109 places in 436 ms of which 4 ms to minimize.
[2024-05-23 08:41:55] [INFO ] Deduced a trap composed of 228 places in 435 ms of which 5 ms to minimize.
[2024-05-23 08:41:56] [INFO ] Deduced a trap composed of 132 places in 424 ms of which 4 ms to minimize.
[2024-05-23 08:41:56] [INFO ] Deduced a trap composed of 82 places in 422 ms of which 5 ms to minimize.
[2024-05-23 08:41:57] [INFO ] Deduced a trap composed of 167 places in 395 ms of which 6 ms to minimize.
[2024-05-23 08:41:57] [INFO ] Deduced a trap composed of 159 places in 337 ms of which 4 ms to minimize.
[2024-05-23 08:41:57] [INFO ] Deduced a trap composed of 160 places in 380 ms of which 5 ms to minimize.
[2024-05-23 08:41:58] [INFO ] Deduced a trap composed of 162 places in 408 ms of which 6 ms to minimize.
[2024-05-23 08:41:58] [INFO ] Deduced a trap composed of 165 places in 444 ms of which 5 ms to minimize.
[2024-05-23 08:41:59] [INFO ] Deduced a trap composed of 160 places in 424 ms of which 5 ms to minimize.
[2024-05-23 08:41:59] [INFO ] Deduced a trap composed of 122 places in 422 ms of which 5 ms to minimize.
[2024-05-23 08:42:00] [INFO ] Deduced a trap composed of 77 places in 422 ms of which 5 ms to minimize.
[2024-05-23 08:42:00] [INFO ] Deduced a trap composed of 132 places in 430 ms of which 6 ms to minimize.
[2024-05-23 08:42:01] [INFO ] Deduced a trap composed of 85 places in 411 ms of which 6 ms to minimize.
[2024-05-23 08:42:01] [INFO ] Deduced a trap composed of 150 places in 391 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:42:02] [INFO ] Deduced a trap composed of 100 places in 416 ms of which 6 ms to minimize.
[2024-05-23 08:42:02] [INFO ] Deduced a trap composed of 116 places in 441 ms of which 5 ms to minimize.
[2024-05-23 08:42:03] [INFO ] Deduced a trap composed of 101 places in 448 ms of which 6 ms to minimize.
[2024-05-23 08:42:03] [INFO ] Deduced a trap composed of 79 places in 430 ms of which 5 ms to minimize.
[2024-05-23 08:42:04] [INFO ] Deduced a trap composed of 95 places in 417 ms of which 5 ms to minimize.
[2024-05-23 08:42:04] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 5 ms to minimize.
[2024-05-23 08:42:04] [INFO ] Deduced a trap composed of 95 places in 387 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 08:42:05] [INFO ] Deduced a trap composed of 161 places in 430 ms of which 5 ms to minimize.
[2024-05-23 08:42:06] [INFO ] Deduced a trap composed of 93 places in 388 ms of which 4 ms to minimize.
[2024-05-23 08:42:06] [INFO ] Deduced a trap composed of 109 places in 420 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 820/1185 variables, 365/439 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1185 variables, 90/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1185 variables, 7/536 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1185 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1185 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1185/1185 variables, and 536 constraints, problems are : Problem set: 0 solved, 7 unsolved in 47825 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 365/365 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 51/51 constraints]
After SMT, in 51195ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 2 properties in 14452 ms.
Support contains 12 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 820/820 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 359 transition count 706
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 359 transition count 706
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 357 transition count 704
Applied a total of 16 rules in 62 ms. Remains 357 /365 variables (removed 8) and now considering 704/820 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 357/365 places, 704/820 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(p0) U p1)))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 111 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 08:42:49] [INFO ] Computed 23 invariants in 14 ms
[2024-05-23 08:42:49] [INFO ] Implicit Places using invariants in 837 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 840 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 15 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 967 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : Anderson-PT-10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Anderson-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-00 finished in 1467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 21 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 08:42:50] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 08:42:51] [INFO ] Implicit Places using invariants in 845 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 847 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 876 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-01 finished in 1037 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&&X(X(F(p0)))) U G(!p1)))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 681
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 681
Applied a total of 50 rules in 36 ms. Remains 442 /467 variables (removed 25) and now considering 681/1120 (removed 439) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-23 08:42:51] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 08:42:52] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-05-23 08:42:52] [INFO ] Invariant cache hit.
[2024-05-23 08:42:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:42:55] [INFO ] Implicit Places using invariants and state equation in 2950 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-05-23 08:42:55] [INFO ] Invariant cache hit.
[2024-05-23 08:42:55] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 08:43:06] [INFO ] Deduced a trap composed of 172 places in 448 ms of which 5 ms to minimize.
[2024-05-23 08:43:06] [INFO ] Deduced a trap composed of 140 places in 472 ms of which 7 ms to minimize.
[2024-05-23 08:43:07] [INFO ] Deduced a trap composed of 133 places in 400 ms of which 5 ms to minimize.
[2024-05-23 08:43:07] [INFO ] Deduced a trap composed of 130 places in 373 ms of which 5 ms to minimize.
[2024-05-23 08:43:08] [INFO ] Deduced a trap composed of 155 places in 399 ms of which 4 ms to minimize.
[2024-05-23 08:43:08] [INFO ] Deduced a trap composed of 217 places in 367 ms of which 5 ms to minimize.
[2024-05-23 08:43:09] [INFO ] Deduced a trap composed of 138 places in 421 ms of which 4 ms to minimize.
[2024-05-23 08:43:09] [INFO ] Deduced a trap composed of 98 places in 464 ms of which 6 ms to minimize.
[2024-05-23 08:43:10] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 5 ms to minimize.
[2024-05-23 08:43:10] [INFO ] Deduced a trap composed of 123 places in 362 ms of which 4 ms to minimize.
[2024-05-23 08:43:10] [INFO ] Deduced a trap composed of 171 places in 359 ms of which 5 ms to minimize.
[2024-05-23 08:43:11] [INFO ] Deduced a trap composed of 148 places in 422 ms of which 5 ms to minimize.
[2024-05-23 08:43:11] [INFO ] Deduced a trap composed of 189 places in 396 ms of which 4 ms to minimize.
[2024-05-23 08:43:12] [INFO ] Deduced a trap composed of 144 places in 451 ms of which 4 ms to minimize.
[2024-05-23 08:43:12] [INFO ] Deduced a trap composed of 175 places in 463 ms of which 7 ms to minimize.
[2024-05-23 08:43:13] [INFO ] Deduced a trap composed of 138 places in 407 ms of which 4 ms to minimize.
[2024-05-23 08:43:13] [INFO ] Deduced a trap composed of 141 places in 404 ms of which 4 ms to minimize.
[2024-05-23 08:43:14] [INFO ] Deduced a trap composed of 98 places in 529 ms of which 4 ms to minimize.
[2024-05-23 08:43:14] [INFO ] Deduced a trap composed of 171 places in 451 ms of which 5 ms to minimize.
[2024-05-23 08:43:15] [INFO ] Deduced a trap composed of 101 places in 432 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 08:43:19] [INFO ] Deduced a trap composed of 216 places in 428 ms of which 4 ms to minimize.
[2024-05-23 08:43:19] [INFO ] Deduced a trap composed of 123 places in 460 ms of which 5 ms to minimize.
[2024-05-23 08:43:20] [INFO ] Deduced a trap composed of 133 places in 404 ms of which 4 ms to minimize.
[2024-05-23 08:43:20] [INFO ] Deduced a trap composed of 250 places in 466 ms of which 7 ms to minimize.
[2024-05-23 08:43:21] [INFO ] Deduced a trap composed of 141 places in 445 ms of which 6 ms to minimize.
[2024-05-23 08:43:21] [INFO ] Deduced a trap composed of 144 places in 430 ms of which 6 ms to minimize.
[2024-05-23 08:43:21] [INFO ] Deduced a trap composed of 177 places in 427 ms of which 5 ms to minimize.
[2024-05-23 08:43:22] [INFO ] Deduced a trap composed of 167 places in 428 ms of which 5 ms to minimize.
[2024-05-23 08:43:22] [INFO ] Deduced a trap composed of 190 places in 407 ms of which 4 ms to minimize.
[2024-05-23 08:43:23] [INFO ] Deduced a trap composed of 173 places in 403 ms of which 5 ms to minimize.
[2024-05-23 08:43:23] [INFO ] Deduced a trap composed of 156 places in 403 ms of which 4 ms to minimize.
[2024-05-23 08:43:24] [INFO ] Deduced a trap composed of 138 places in 385 ms of which 5 ms to minimize.
[2024-05-23 08:43:24] [INFO ] Deduced a trap composed of 218 places in 467 ms of which 6 ms to minimize.
[2024-05-23 08:43:25] [INFO ] Deduced a trap composed of 185 places in 462 ms of which 7 ms to minimize.
[2024-05-23 08:43:25] [INFO ] Deduced a trap composed of 227 places in 433 ms of which 6 ms to minimize.
[2024-05-23 08:43:25] [INFO ] Deduced a trap composed of 234 places in 366 ms of which 4 ms to minimize.
SMT process timed out in 30943ms, After SMT, problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 30957ms
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 681/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34587 ms. Remains : 442/467 places, 681/1120 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 711 ms.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 1/3 properties
[2024-05-23 08:43:27] [INFO ] Invariant cache hit.
[2024-05-23 08:43:27] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 425/1123 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/12 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 429 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 20 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 08:43:29] [INFO ] Invariant cache hit.
[2024-05-23 08:43:29] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-23 08:43:29] [INFO ] Invariant cache hit.
[2024-05-23 08:43:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:43:32] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 3707 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-05-23 08:43:32] [INFO ] Invariant cache hit.
[2024-05-23 08:43:32] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 08:43:46] [INFO ] Deduced a trap composed of 172 places in 446 ms of which 5 ms to minimize.
[2024-05-23 08:43:46] [INFO ] Deduced a trap composed of 140 places in 465 ms of which 5 ms to minimize.
[2024-05-23 08:43:47] [INFO ] Deduced a trap composed of 133 places in 439 ms of which 5 ms to minimize.
[2024-05-23 08:43:47] [INFO ] Deduced a trap composed of 130 places in 434 ms of which 5 ms to minimize.
[2024-05-23 08:43:48] [INFO ] Deduced a trap composed of 155 places in 423 ms of which 7 ms to minimize.
[2024-05-23 08:43:48] [INFO ] Deduced a trap composed of 217 places in 438 ms of which 4 ms to minimize.
[2024-05-23 08:43:49] [INFO ] Deduced a trap composed of 138 places in 396 ms of which 5 ms to minimize.
[2024-05-23 08:43:49] [INFO ] Deduced a trap composed of 98 places in 423 ms of which 4 ms to minimize.
[2024-05-23 08:43:50] [INFO ] Deduced a trap composed of 97 places in 432 ms of which 5 ms to minimize.
[2024-05-23 08:43:50] [INFO ] Deduced a trap composed of 123 places in 445 ms of which 5 ms to minimize.
[2024-05-23 08:43:51] [INFO ] Deduced a trap composed of 171 places in 431 ms of which 7 ms to minimize.
[2024-05-23 08:43:51] [INFO ] Deduced a trap composed of 148 places in 427 ms of which 5 ms to minimize.
[2024-05-23 08:43:52] [INFO ] Deduced a trap composed of 189 places in 431 ms of which 9 ms to minimize.
[2024-05-23 08:43:52] [INFO ] Deduced a trap composed of 144 places in 435 ms of which 5 ms to minimize.
[2024-05-23 08:43:53] [INFO ] Deduced a trap composed of 175 places in 443 ms of which 5 ms to minimize.
[2024-05-23 08:43:53] [INFO ] Deduced a trap composed of 138 places in 413 ms of which 6 ms to minimize.
[2024-05-23 08:43:53] [INFO ] Deduced a trap composed of 141 places in 444 ms of which 5 ms to minimize.
[2024-05-23 08:43:54] [INFO ] Deduced a trap composed of 98 places in 458 ms of which 7 ms to minimize.
[2024-05-23 08:43:54] [INFO ] Deduced a trap composed of 171 places in 460 ms of which 6 ms to minimize.
[2024-05-23 08:43:55] [INFO ] Deduced a trap composed of 101 places in 340 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 08:44:00] [INFO ] Deduced a trap composed of 216 places in 388 ms of which 4 ms to minimize.
[2024-05-23 08:44:00] [INFO ] Deduced a trap composed of 123 places in 411 ms of which 7 ms to minimize.
[2024-05-23 08:44:00] [INFO ] Deduced a trap composed of 133 places in 466 ms of which 4 ms to minimize.
[2024-05-23 08:44:01] [INFO ] Deduced a trap composed of 250 places in 393 ms of which 6 ms to minimize.
[2024-05-23 08:44:01] [INFO ] Deduced a trap composed of 141 places in 481 ms of which 5 ms to minimize.
[2024-05-23 08:44:02] [INFO ] Deduced a trap composed of 144 places in 383 ms of which 4 ms to minimize.
[2024-05-23 08:44:02] [INFO ] Deduced a trap composed of 177 places in 398 ms of which 5 ms to minimize.
[2024-05-23 08:44:03] [INFO ] Deduced a trap composed of 167 places in 407 ms of which 5 ms to minimize.
[2024-05-23 08:44:03] [INFO ] Deduced a trap composed of 190 places in 395 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1123 variables, and 51 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 29/51 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-23 08:44:30] [INFO ] Deduced a trap composed of 204 places in 329 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/1123 variables, and 52 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 30/30 constraints]
After SMT, in 60725ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Finished structural reductions in LTL mode , in 1 iterations and 64467 ms. Remains : 442/442 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/4 properties
BEST_FIRST walk for 31525 steps (6 resets) in 44 ms. (700 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 229 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Entered a terminal (fully accepting) state of product in 14547 steps with 0 reset in 76 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 104013 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)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 68 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 08:44:35] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 08:44:36] [INFO ] Implicit Places using invariants in 801 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 810 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 15 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 893 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 557 ms.
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-03 finished in 2100 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||X(p1)||G(p2))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 700
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 700
Applied a total of 48 rules in 19 ms. Remains 443 /467 variables (removed 24) and now considering 700/1120 (removed 420) transitions.
// Phase 1: matrix 700 rows 443 cols
[2024-05-23 08:44:37] [INFO ] Computed 23 invariants in 8 ms
[2024-05-23 08:44:38] [INFO ] Implicit Places using invariants in 695 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 698 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 700/1120 transitions.
Applied a total of 0 rules in 9 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 442/467 places, 700/1120 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 1858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 08:44:39] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 08:44:40] [INFO ] Implicit Places using invariants in 783 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 785 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 14 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 818 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(((p1 U p2)&&p0)) U G(p3))))))'
Support contains 8 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 445 transition count 756
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 445 transition count 756
Applied a total of 44 rules in 25 ms. Remains 445 /467 variables (removed 22) and now considering 756/1120 (removed 364) transitions.
// Phase 1: matrix 756 rows 445 cols
[2024-05-23 08:44:40] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 08:44:41] [INFO ] Implicit Places using invariants in 762 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 764 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/467 places, 756/1120 transitions.
Applied a total of 0 rules in 34 ms. Remains 444 /444 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 823 ms. Remains : 444/467 places, 756/1120 transitions.
Stuttering acceptance computed with spot in 431 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-06 finished in 1294 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)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 50 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-23 08:44:41] [INFO ] Computed 23 invariants in 6 ms
[2024-05-23 08:44:42] [INFO ] Implicit Places using invariants in 928 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 931 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 22 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 08:44:42] [INFO ] Computed 22 invariants in 11 ms
[2024-05-23 08:44:43] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-23 08:44:43] [INFO ] Invariant cache hit.
[2024-05-23 08:44:43] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:44:44] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2746 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 0 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
[2024-05-23 08:44:45] [INFO ] Invariant cache hit.
[2024-05-23 08:44:45] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 08:44:45] [INFO ] Deduced a trap composed of 87 places in 279 ms of which 4 ms to minimize.
[2024-05-23 08:44:45] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 3 ms to minimize.
[2024-05-23 08:44:46] [INFO ] Deduced a trap composed of 95 places in 278 ms of which 4 ms to minimize.
[2024-05-23 08:44:46] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1434 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1947ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 29 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 875868 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 1
Probabilistic random walk after 875868 steps, saw 629797 distinct states, run finished after 3006 ms. (steps per millisecond=291 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-05-23 08:44:50] [INFO ] Computed 22 invariants in 6 ms
[2024-05-23 08:44:50] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 08:44:50] [INFO ] Deduced a trap composed of 78 places in 298 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-23 08:44:51] [INFO ] Invariant cache hit.
[2024-05-23 08:44:51] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-23 08:44:52] [INFO ] Invariant cache hit.
[2024-05-23 08:44:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:44:53] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2024-05-23 08:44:53] [INFO ] Redundant transitions in 34 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-23 08:44:53] [INFO ] Invariant cache hit.
[2024-05-23 08:44:53] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:44:58] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 4 ms to minimize.
[2024-05-23 08:44:58] [INFO ] Deduced a trap composed of 78 places in 214 ms of which 3 ms to minimize.
[2024-05-23 08:44:58] [INFO ] Deduced a trap composed of 106 places in 221 ms of which 3 ms to minimize.
[2024-05-23 08:44:59] [INFO ] Deduced a trap composed of 89 places in 215 ms of which 3 ms to minimize.
[2024-05-23 08:44:59] [INFO ] Deduced a trap composed of 102 places in 230 ms of which 3 ms to minimize.
[2024-05-23 08:44:59] [INFO ] Deduced a trap composed of 98 places in 217 ms of which 3 ms to minimize.
[2024-05-23 08:44:59] [INFO ] Deduced a trap composed of 98 places in 210 ms of which 3 ms to minimize.
[2024-05-23 08:45:00] [INFO ] Deduced a trap composed of 99 places in 214 ms of which 3 ms to minimize.
[2024-05-23 08:45:00] [INFO ] Deduced a trap composed of 104 places in 211 ms of which 2 ms to minimize.
[2024-05-23 08:45:00] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 3 ms to minimize.
[2024-05-23 08:45:00] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 3 ms to minimize.
[2024-05-23 08:45:01] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-23 08:45:01] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 3 ms to minimize.
[2024-05-23 08:45:02] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 3 ms to minimize.
[2024-05-23 08:45:02] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 2 ms to minimize.
[2024-05-23 08:45:02] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 2 ms to minimize.
[2024-05-23 08:45:03] [INFO ] Deduced a trap composed of 88 places in 204 ms of which 3 ms to minimize.
[2024-05-23 08:45:03] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 3 ms to minimize.
[2024-05-23 08:45:03] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
[2024-05-23 08:45:03] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:45:05] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
[2024-05-23 08:45:05] [INFO ] Deduced a trap composed of 107 places in 281 ms of which 4 ms to minimize.
[2024-05-23 08:45:05] [INFO ] Deduced a trap composed of 102 places in 272 ms of which 4 ms to minimize.
[2024-05-23 08:45:06] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 3 ms to minimize.
[2024-05-23 08:45:06] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 4 ms to minimize.
[2024-05-23 08:45:06] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 3 ms to minimize.
[2024-05-23 08:45:07] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 4 ms to minimize.
[2024-05-23 08:45:07] [INFO ] Deduced a trap composed of 60 places in 215 ms of which 3 ms to minimize.
[2024-05-23 08:45:08] [INFO ] Deduced a trap composed of 60 places in 287 ms of which 4 ms to minimize.
[2024-05-23 08:45:08] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 4 ms to minimize.
[2024-05-23 08:45:08] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 4 ms to minimize.
[2024-05-23 08:45:08] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 3 ms to minimize.
[2024-05-23 08:45:09] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 4 ms to minimize.
[2024-05-23 08:45:09] [INFO ] Deduced a trap composed of 71 places in 275 ms of which 4 ms to minimize.
[2024-05-23 08:45:09] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 4 ms to minimize.
[2024-05-23 08:45:10] [INFO ] Deduced a trap composed of 99 places in 276 ms of which 4 ms to minimize.
[2024-05-23 08:45:10] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 3 ms to minimize.
[2024-05-23 08:45:10] [INFO ] Deduced a trap composed of 98 places in 283 ms of which 4 ms to minimize.
[2024-05-23 08:45:10] [INFO ] Deduced a trap composed of 112 places in 198 ms of which 2 ms to minimize.
[2024-05-23 08:45:11] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:45:16] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 3 ms to minimize.
[2024-05-23 08:45:17] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 3 ms to minimize.
[2024-05-23 08:45:17] [INFO ] Deduced a trap composed of 102 places in 191 ms of which 3 ms to minimize.
[2024-05-23 08:45:17] [INFO ] Deduced a trap composed of 101 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:45:17] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 2 ms to minimize.
[2024-05-23 08:45:17] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 2 ms to minimize.
[2024-05-23 08:45:18] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 2 ms to minimize.
[2024-05-23 08:45:18] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 3 ms to minimize.
[2024-05-23 08:45:18] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:45:18] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 2 ms to minimize.
[2024-05-23 08:45:18] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2024-05-23 08:45:19] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2024-05-23 08:45:19] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 2 ms to minimize.
[2024-05-23 08:45:19] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 3 ms to minimize.
[2024-05-23 08:45:19] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2024-05-23 08:45:20] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 3 ms to minimize.
[2024-05-23 08:45:20] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 3 ms to minimize.
[2024-05-23 08:45:20] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 3 ms to minimize.
[2024-05-23 08:45:20] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-05-23 08:45:20] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:45:23] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 4 ms to minimize.
[2024-05-23 08:45:23] [INFO ] Deduced a trap composed of 102 places in 191 ms of which 3 ms to minimize.
[2024-05-23 08:45:23] [INFO ] Deduced a trap composed of 93 places in 185 ms of which 3 ms to minimize.
[2024-05-23 08:45:23] [INFO ] Deduced a trap composed of 91 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 30724ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 30731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32359 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 24 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-23 08:45:23] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 08:45:23] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-23 08:45:23] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-23 08:45:24] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:45:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-23 08:45:24] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 14 ms returned sat
[2024-05-23 08:45:24] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:45:24] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:45:24] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 769 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 87 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 10 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 08:45:24] [INFO ] Computed 22 invariants in 6 ms
[2024-05-23 08:45:25] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-23 08:45:25] [INFO ] Invariant cache hit.
[2024-05-23 08:45:26] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:45:26] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
[2024-05-23 08:45:26] [INFO ] Redundant transitions in 22 ms returned []
Running 520 sub problems to find dead transitions.
[2024-05-23 08:45:26] [INFO ] Invariant cache hit.
[2024-05-23 08:45:27] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:45:32] [INFO ] Deduced a trap composed of 94 places in 284 ms of which 4 ms to minimize.
[2024-05-23 08:45:33] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 4 ms to minimize.
[2024-05-23 08:45:33] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 3 ms to minimize.
[2024-05-23 08:45:34] [INFO ] Deduced a trap composed of 78 places in 269 ms of which 4 ms to minimize.
[2024-05-23 08:45:34] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 3 ms to minimize.
[2024-05-23 08:45:34] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 3 ms to minimize.
[2024-05-23 08:45:34] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 3 ms to minimize.
[2024-05-23 08:45:35] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 3 ms to minimize.
[2024-05-23 08:45:35] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 3 ms to minimize.
[2024-05-23 08:45:35] [INFO ] Deduced a trap composed of 92 places in 219 ms of which 3 ms to minimize.
[2024-05-23 08:45:35] [INFO ] Deduced a trap composed of 81 places in 218 ms of which 2 ms to minimize.
[2024-05-23 08:45:36] [INFO ] Deduced a trap composed of 83 places in 287 ms of which 4 ms to minimize.
[2024-05-23 08:45:36] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 3 ms to minimize.
[2024-05-23 08:45:36] [INFO ] Deduced a trap composed of 89 places in 283 ms of which 4 ms to minimize.
[2024-05-23 08:45:36] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 2 ms to minimize.
[2024-05-23 08:45:37] [INFO ] Deduced a trap composed of 109 places in 289 ms of which 5 ms to minimize.
[2024-05-23 08:45:37] [INFO ] Deduced a trap composed of 90 places in 285 ms of which 4 ms to minimize.
[2024-05-23 08:45:37] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 3 ms to minimize.
[2024-05-23 08:45:37] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 4 ms to minimize.
[2024-05-23 08:45:38] [INFO ] Deduced a trap composed of 71 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:45:39] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 3 ms to minimize.
[2024-05-23 08:45:39] [INFO ] Deduced a trap composed of 78 places in 282 ms of which 5 ms to minimize.
[2024-05-23 08:45:40] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-05-23 08:45:40] [INFO ] Deduced a trap composed of 110 places in 218 ms of which 3 ms to minimize.
[2024-05-23 08:45:40] [INFO ] Deduced a trap composed of 106 places in 255 ms of which 3 ms to minimize.
[2024-05-23 08:45:40] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 3 ms to minimize.
[2024-05-23 08:45:43] [INFO ] Deduced a trap composed of 105 places in 252 ms of which 4 ms to minimize.
[2024-05-23 08:45:43] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 3 ms to minimize.
[2024-05-23 08:45:43] [INFO ] Deduced a trap composed of 99 places in 216 ms of which 6 ms to minimize.
[2024-05-23 08:45:44] [INFO ] Deduced a trap composed of 73 places in 295 ms of which 4 ms to minimize.
[2024-05-23 08:45:44] [INFO ] Deduced a trap composed of 77 places in 283 ms of which 4 ms to minimize.
[2024-05-23 08:45:44] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 3 ms to minimize.
[2024-05-23 08:45:44] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 4 ms to minimize.
[2024-05-23 08:45:45] [INFO ] Deduced a trap composed of 94 places in 281 ms of which 4 ms to minimize.
[2024-05-23 08:45:45] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 6 ms to minimize.
[2024-05-23 08:45:45] [INFO ] Deduced a trap composed of 98 places in 212 ms of which 3 ms to minimize.
[2024-05-23 08:45:46] [INFO ] Deduced a trap composed of 87 places in 217 ms of which 3 ms to minimize.
[2024-05-23 08:45:46] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 3 ms to minimize.
[2024-05-23 08:45:46] [INFO ] Deduced a trap composed of 89 places in 284 ms of which 4 ms to minimize.
[2024-05-23 08:45:46] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:45:52] [INFO ] Deduced a trap composed of 94 places in 338 ms of which 4 ms to minimize.
[2024-05-23 08:45:52] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 3 ms to minimize.
[2024-05-23 08:45:52] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 3 ms to minimize.
[2024-05-23 08:45:54] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:45:54] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 2 ms to minimize.
[2024-05-23 08:45:54] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 3 ms to minimize.
[2024-05-23 08:45:54] [INFO ] Deduced a trap composed of 106 places in 243 ms of which 4 ms to minimize.
[2024-05-23 08:45:55] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 4 ms to minimize.
[2024-05-23 08:45:55] [INFO ] Deduced a trap composed of 119 places in 248 ms of which 3 ms to minimize.
[2024-05-23 08:45:55] [INFO ] Deduced a trap composed of 121 places in 250 ms of which 3 ms to minimize.
[2024-05-23 08:45:56] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 3 ms to minimize.
[2024-05-23 08:45:56] [INFO ] Deduced a trap composed of 101 places in 248 ms of which 3 ms to minimize.
[2024-05-23 08:45:56] [INFO ] Deduced a trap composed of 92 places in 256 ms of which 3 ms to minimize.
[2024-05-23 08:45:56] [INFO ] Deduced a trap composed of 93 places in 257 ms of which 3 ms to minimize.
[2024-05-23 08:45:57] [INFO ] Deduced a trap composed of 114 places in 246 ms of which 3 ms to minimize.
[2024-05-23 08:45:57] [INFO ] Deduced a trap composed of 96 places in 193 ms of which 3 ms to minimize.
[2024-05-23 08:45:57] [INFO ] Deduced a trap composed of 108 places in 251 ms of which 3 ms to minimize.
SMT process timed out in 30594ms, After SMT, problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 30605ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32675 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p0 p1), p1]
RANDOM walk for 40000 steps (8 resets) in 557 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-23 08:45:58] [INFO ] Invariant cache hit.
[2024-05-23 08:45:58] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 08:45:58] [INFO ] Deduced a trap composed of 87 places in 241 ms of which 4 ms to minimize.
[2024-05-23 08:45:58] [INFO ] Deduced a trap composed of 87 places in 245 ms of which 3 ms to minimize.
[2024-05-23 08:45:59] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:45:59] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 223/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/245 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/254 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 530/784 variables, 254/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/784 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 254/254 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 20 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 252/254 places, 528/530 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 839667 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 839667 steps, saw 604986 distinct states, run finished after 3004 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 528 rows 252 cols
[2024-05-23 08:46:03] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 08:46:03] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 08:46:03] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/225 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/233 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 528/780 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 90/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1003ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-23 08:46:04] [INFO ] Invariant cache hit.
[2024-05-23 08:46:04] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-23 08:46:04] [INFO ] Invariant cache hit.
[2024-05-23 08:46:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:46:05] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2024-05-23 08:46:05] [INFO ] Redundant transitions in 9 ms returned []
Running 518 sub problems to find dead transitions.
[2024-05-23 08:46:06] [INFO ] Invariant cache hit.
[2024-05-23 08:46:06] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:11] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 3 ms to minimize.
[2024-05-23 08:46:12] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 3 ms to minimize.
[2024-05-23 08:46:12] [INFO ] Deduced a trap composed of 106 places in 241 ms of which 3 ms to minimize.
[2024-05-23 08:46:12] [INFO ] Deduced a trap composed of 89 places in 254 ms of which 4 ms to minimize.
[2024-05-23 08:46:13] [INFO ] Deduced a trap composed of 102 places in 251 ms of which 2 ms to minimize.
[2024-05-23 08:46:13] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 3 ms to minimize.
[2024-05-23 08:46:13] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 3 ms to minimize.
[2024-05-23 08:46:13] [INFO ] Deduced a trap composed of 99 places in 246 ms of which 3 ms to minimize.
[2024-05-23 08:46:14] [INFO ] Deduced a trap composed of 104 places in 257 ms of which 3 ms to minimize.
[2024-05-23 08:46:14] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 3 ms to minimize.
[2024-05-23 08:46:14] [INFO ] Deduced a trap composed of 89 places in 201 ms of which 3 ms to minimize.
[2024-05-23 08:46:15] [INFO ] Deduced a trap composed of 95 places in 261 ms of which 3 ms to minimize.
[2024-05-23 08:46:16] [INFO ] Deduced a trap composed of 83 places in 219 ms of which 3 ms to minimize.
[2024-05-23 08:46:16] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 3 ms to minimize.
[2024-05-23 08:46:17] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 3 ms to minimize.
[2024-05-23 08:46:17] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 3 ms to minimize.
[2024-05-23 08:46:17] [INFO ] Deduced a trap composed of 88 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:46:17] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-23 08:46:18] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-23 08:46:18] [INFO ] Deduced a trap composed of 80 places in 239 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:19] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 2 ms to minimize.
[2024-05-23 08:46:20] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 3 ms to minimize.
[2024-05-23 08:46:20] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 3 ms to minimize.
[2024-05-23 08:46:20] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:46:20] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 3 ms to minimize.
[2024-05-23 08:46:21] [INFO ] Deduced a trap composed of 73 places in 233 ms of which 4 ms to minimize.
[2024-05-23 08:46:22] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 3 ms to minimize.
[2024-05-23 08:46:22] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 3 ms to minimize.
[2024-05-23 08:46:22] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 3 ms to minimize.
[2024-05-23 08:46:23] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-23 08:46:23] [INFO ] Deduced a trap composed of 56 places in 252 ms of which 3 ms to minimize.
[2024-05-23 08:46:23] [INFO ] Deduced a trap composed of 63 places in 255 ms of which 3 ms to minimize.
[2024-05-23 08:46:23] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
[2024-05-23 08:46:24] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 3 ms to minimize.
[2024-05-23 08:46:24] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 3 ms to minimize.
[2024-05-23 08:46:24] [INFO ] Deduced a trap composed of 99 places in 234 ms of which 3 ms to minimize.
[2024-05-23 08:46:25] [INFO ] Deduced a trap composed of 87 places in 248 ms of which 3 ms to minimize.
[2024-05-23 08:46:25] [INFO ] Deduced a trap composed of 98 places in 251 ms of which 3 ms to minimize.
[2024-05-23 08:46:25] [INFO ] Deduced a trap composed of 112 places in 242 ms of which 4 ms to minimize.
[2024-05-23 08:46:25] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:30] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 3 ms to minimize.
[2024-05-23 08:46:30] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 3 ms to minimize.
[2024-05-23 08:46:31] [INFO ] Deduced a trap composed of 102 places in 215 ms of which 3 ms to minimize.
[2024-05-23 08:46:31] [INFO ] Deduced a trap composed of 101 places in 225 ms of which 3 ms to minimize.
[2024-05-23 08:46:31] [INFO ] Deduced a trap composed of 94 places in 231 ms of which 3 ms to minimize.
[2024-05-23 08:46:31] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-05-23 08:46:32] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 3 ms to minimize.
[2024-05-23 08:46:32] [INFO ] Deduced a trap composed of 106 places in 235 ms of which 3 ms to minimize.
[2024-05-23 08:46:32] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:46:32] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 3 ms to minimize.
[2024-05-23 08:46:32] [INFO ] Deduced a trap composed of 77 places in 245 ms of which 2 ms to minimize.
[2024-05-23 08:46:33] [INFO ] Deduced a trap composed of 68 places in 238 ms of which 3 ms to minimize.
[2024-05-23 08:46:33] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 3 ms to minimize.
[2024-05-23 08:46:33] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 3 ms to minimize.
[2024-05-23 08:46:33] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 3 ms to minimize.
[2024-05-23 08:46:34] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 3 ms to minimize.
[2024-05-23 08:46:34] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 2 ms to minimize.
[2024-05-23 08:46:34] [INFO ] Deduced a trap composed of 80 places in 232 ms of which 3 ms to minimize.
[2024-05-23 08:46:35] [INFO ] Deduced a trap composed of 94 places in 233 ms of which 3 ms to minimize.
[2024-05-23 08:46:35] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/780 variables, and 82 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 60/82 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:41] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 3 ms to minimize.
[2024-05-23 08:46:41] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 2 ms to minimize.
[2024-05-23 08:46:41] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 3 ms to minimize.
[2024-05-23 08:46:41] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 3 ms to minimize.
[2024-05-23 08:46:42] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-05-23 08:46:42] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 3 ms to minimize.
[2024-05-23 08:46:42] [INFO ] Deduced a trap composed of 74 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:46:42] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 3 ms to minimize.
[2024-05-23 08:46:43] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 3 ms to minimize.
[2024-05-23 08:46:43] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 2 ms to minimize.
[2024-05-23 08:46:43] [INFO ] Deduced a trap composed of 109 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:46:43] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-05-23 08:46:43] [INFO ] Deduced a trap composed of 105 places in 187 ms of which 2 ms to minimize.
[2024-05-23 08:46:44] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 3 ms to minimize.
[2024-05-23 08:46:44] [INFO ] Deduced a trap composed of 101 places in 206 ms of which 4 ms to minimize.
[2024-05-23 08:46:44] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 3 ms to minimize.
[2024-05-23 08:46:44] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:46:44] [INFO ] Deduced a trap composed of 100 places in 263 ms of which 3 ms to minimize.
[2024-05-23 08:46:45] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 3 ms to minimize.
[2024-05-23 08:46:45] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:48] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 2 ms to minimize.
[2024-05-23 08:46:48] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 2 ms to minimize.
[2024-05-23 08:46:50] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-05-23 08:46:50] [INFO ] Deduced a trap composed of 93 places in 289 ms of which 4 ms to minimize.
[2024-05-23 08:46:51] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-05-23 08:46:51] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 3 ms to minimize.
[2024-05-23 08:46:51] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 3 ms to minimize.
[2024-05-23 08:46:51] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-23 08:46:51] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 3 ms to minimize.
[2024-05-23 08:46:52] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 3 ms to minimize.
[2024-05-23 08:46:52] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 4 ms to minimize.
[2024-05-23 08:46:52] [INFO ] Deduced a trap composed of 109 places in 245 ms of which 2 ms to minimize.
[2024-05-23 08:46:52] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 3 ms to minimize.
[2024-05-23 08:46:53] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 3 ms to minimize.
[2024-05-23 08:46:53] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 2 ms to minimize.
[2024-05-23 08:46:53] [INFO ] Deduced a trap composed of 116 places in 224 ms of which 3 ms to minimize.
[2024-05-23 08:46:53] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 3 ms to minimize.
[2024-05-23 08:46:53] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 2 ms to minimize.
[2024-05-23 08:46:54] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 3 ms to minimize.
[2024-05-23 08:46:54] [INFO ] Deduced a trap composed of 102 places in 216 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-23 08:46:57] [INFO ] Deduced a trap composed of 100 places in 279 ms of which 4 ms to minimize.
[2024-05-23 08:46:58] [INFO ] Deduced a trap composed of 99 places in 270 ms of which 4 ms to minimize.
[2024-05-23 08:46:58] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 3 ms to minimize.
[2024-05-23 08:46:58] [INFO ] Deduced a trap composed of 73 places in 279 ms of which 4 ms to minimize.
[2024-05-23 08:46:58] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 2 ms to minimize.
[2024-05-23 08:46:58] [INFO ] Deduced a trap composed of 90 places in 218 ms of which 3 ms to minimize.
[2024-05-23 08:46:59] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:46:59] [INFO ] Deduced a trap composed of 88 places in 229 ms of which 3 ms to minimize.
[2024-05-23 08:46:59] [INFO ] Deduced a trap composed of 97 places in 228 ms of which 3 ms to minimize.
[2024-05-23 08:46:59] [INFO ] Deduced a trap composed of 79 places in 228 ms of which 3 ms to minimize.
[2024-05-23 08:47:00] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 3 ms to minimize.
[2024-05-23 08:47:00] [INFO ] Deduced a trap composed of 81 places in 204 ms of which 2 ms to minimize.
[2024-05-23 08:47:00] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 3 ms to minimize.
[2024-05-23 08:47:00] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 3 ms to minimize.
[2024-05-23 08:47:01] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-05-23 08:47:01] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 2 ms to minimize.
[2024-05-23 08:47:01] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 3 ms to minimize.
[2024-05-23 08:47:01] [INFO ] Deduced a trap composed of 92 places in 221 ms of which 3 ms to minimize.
[2024-05-23 08:47:01] [INFO ] Deduced a trap composed of 81 places in 242 ms of which 3 ms to minimize.
[2024-05-23 08:47:02] [INFO ] Deduced a trap composed of 76 places in 256 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/780 variables, and 142 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 120/120 constraints]
After SMT, in 60636ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62386 ms. Remains : 252/252 places, 528/528 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 17 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-23 08:47:06] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 08:47:06] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2024-05-23 08:47:06] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-23 08:47:06] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 08:47:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-23 08:47:07] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 14 ms returned sat
[2024-05-23 08:47:07] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 08:47:07] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 08:47:07] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 642 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 233 ms.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 18 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 08:47:08] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 08:47:08] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-23 08:47:08] [INFO ] Invariant cache hit.
[2024-05-23 08:47:08] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:47:09] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2024-05-23 08:47:09] [INFO ] Redundant transitions in 5 ms returned []
Running 520 sub problems to find dead transitions.
[2024-05-23 08:47:09] [INFO ] Invariant cache hit.
[2024-05-23 08:47:09] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:47:14] [INFO ] Deduced a trap composed of 94 places in 198 ms of which 3 ms to minimize.
[2024-05-23 08:47:15] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 08:47:15] [INFO ] Deduced a trap composed of 85 places in 224 ms of which 3 ms to minimize.
[2024-05-23 08:47:16] [INFO ] Deduced a trap composed of 78 places in 282 ms of which 4 ms to minimize.
[2024-05-23 08:47:16] [INFO ] Deduced a trap composed of 69 places in 280 ms of which 5 ms to minimize.
[2024-05-23 08:47:16] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 3 ms to minimize.
[2024-05-23 08:47:16] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 3 ms to minimize.
[2024-05-23 08:47:17] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 4 ms to minimize.
[2024-05-23 08:47:17] [INFO ] Deduced a trap composed of 112 places in 224 ms of which 3 ms to minimize.
[2024-05-23 08:47:17] [INFO ] Deduced a trap composed of 92 places in 282 ms of which 4 ms to minimize.
[2024-05-23 08:47:18] [INFO ] Deduced a trap composed of 81 places in 243 ms of which 3 ms to minimize.
[2024-05-23 08:47:18] [INFO ] Deduced a trap composed of 83 places in 229 ms of which 2 ms to minimize.
[2024-05-23 08:47:18] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-23 08:47:18] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 3 ms to minimize.
[2024-05-23 08:47:19] [INFO ] Deduced a trap composed of 89 places in 237 ms of which 3 ms to minimize.
[2024-05-23 08:47:19] [INFO ] Deduced a trap composed of 109 places in 283 ms of which 4 ms to minimize.
[2024-05-23 08:47:19] [INFO ] Deduced a trap composed of 90 places in 223 ms of which 2 ms to minimize.
[2024-05-23 08:47:19] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 3 ms to minimize.
[2024-05-23 08:47:20] [INFO ] Deduced a trap composed of 99 places in 278 ms of which 4 ms to minimize.
[2024-05-23 08:47:20] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:47:21] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 3 ms to minimize.
[2024-05-23 08:47:22] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 4 ms to minimize.
[2024-05-23 08:47:22] [INFO ] Deduced a trap composed of 82 places in 277 ms of which 4 ms to minimize.
[2024-05-23 08:47:22] [INFO ] Deduced a trap composed of 110 places in 214 ms of which 2 ms to minimize.
[2024-05-23 08:47:22] [INFO ] Deduced a trap composed of 106 places in 256 ms of which 3 ms to minimize.
[2024-05-23 08:47:23] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 3 ms to minimize.
[2024-05-23 08:47:24] [INFO ] Deduced a trap composed of 105 places in 165 ms of which 3 ms to minimize.
[2024-05-23 08:47:25] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 3 ms to minimize.
[2024-05-23 08:47:25] [INFO ] Deduced a trap composed of 99 places in 288 ms of which 4 ms to minimize.
[2024-05-23 08:47:25] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 2 ms to minimize.
[2024-05-23 08:47:25] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 4 ms to minimize.
[2024-05-23 08:47:26] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 3 ms to minimize.
[2024-05-23 08:47:26] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 5 ms to minimize.
[2024-05-23 08:47:26] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 3 ms to minimize.
[2024-05-23 08:47:27] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 5 ms to minimize.
[2024-05-23 08:47:27] [INFO ] Deduced a trap composed of 98 places in 224 ms of which 3 ms to minimize.
[2024-05-23 08:47:27] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 4 ms to minimize.
[2024-05-23 08:47:27] [INFO ] Deduced a trap composed of 106 places in 300 ms of which 4 ms to minimize.
[2024-05-23 08:47:28] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 2 ms to minimize.
[2024-05-23 08:47:28] [INFO ] Deduced a trap composed of 89 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-23 08:47:35] [INFO ] Deduced a trap composed of 94 places in 262 ms of which 3 ms to minimize.
[2024-05-23 08:47:35] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 3 ms to minimize.
[2024-05-23 08:47:35] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 3 ms to minimize.
[2024-05-23 08:47:36] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 3 ms to minimize.
[2024-05-23 08:47:36] [INFO ] Deduced a trap composed of 104 places in 292 ms of which 5 ms to minimize.
[2024-05-23 08:47:37] [INFO ] Deduced a trap composed of 89 places in 252 ms of which 4 ms to minimize.
[2024-05-23 08:47:37] [INFO ] Deduced a trap composed of 106 places in 275 ms of which 4 ms to minimize.
[2024-05-23 08:47:37] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 4 ms to minimize.
[2024-05-23 08:47:38] [INFO ] Deduced a trap composed of 119 places in 259 ms of which 4 ms to minimize.
[2024-05-23 08:47:38] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 3 ms to minimize.
[2024-05-23 08:47:38] [INFO ] Deduced a trap composed of 86 places in 288 ms of which 4 ms to minimize.
[2024-05-23 08:47:38] [INFO ] Deduced a trap composed of 101 places in 292 ms of which 4 ms to minimize.
[2024-05-23 08:47:39] [INFO ] Deduced a trap composed of 92 places in 266 ms of which 5 ms to minimize.
[2024-05-23 08:47:39] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 3 ms to minimize.
[2024-05-23 08:47:39] [INFO ] Deduced a trap composed of 114 places in 298 ms of which 3 ms to minimize.
[2024-05-23 08:47:40] [INFO ] Deduced a trap composed of 96 places in 294 ms of which 3 ms to minimize.
[2024-05-23 08:47:40] [INFO ] Deduced a trap composed of 108 places in 288 ms of which 3 ms to minimize.
SMT process timed out in 30646ms, After SMT, problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 30656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32325 ms. Remains : 254/254 places, 530/530 transitions.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 179071 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))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 50 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-23 08:47:40] [INFO ] Computed 23 invariants in 9 ms
[2024-05-23 08:47:41] [INFO ] Implicit Places using invariants in 705 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 708 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 19 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-23 08:47:41] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 08:47:42] [INFO ] Implicit Places using invariants in 829 ms returned []
[2024-05-23 08:47:42] [INFO ] Invariant cache hit.
[2024-05-23 08:47:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:47:43] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2716 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 488 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 3269 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))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 48 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-23 08:47:44] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 08:47:44] [INFO ] Implicit Places using invariants in 796 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 798 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 19 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-23 08:47:44] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 08:47:45] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-23 08:47:45] [INFO ] Invariant cache hit.
[2024-05-23 08:47:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:47:46] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2510 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 287 ms.
Stack based approach found an accepted trace after 78 steps with 1 reset with depth 72 and stack size 72 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 2853 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)))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 699
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 699
Applied a total of 50 rules in 19 ms. Remains 442 /467 variables (removed 25) and now considering 699/1120 (removed 421) transitions.
// Phase 1: matrix 699 rows 442 cols
[2024-05-23 08:47:46] [INFO ] Computed 23 invariants in 8 ms
[2024-05-23 08:47:47] [INFO ] Implicit Places using invariants in 821 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 823 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/467 places, 699/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 441 /441 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 850 ms. Remains : 441/467 places, 699/1120 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 5 reset in 260 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 1201 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((G(p1)&&p0))&&F(G(p2)))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 444 transition count 719
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 444 transition count 719
Applied a total of 46 rules in 29 ms. Remains 444 /467 variables (removed 23) and now considering 719/1120 (removed 401) transitions.
// Phase 1: matrix 719 rows 444 cols
[2024-05-23 08:47:48] [INFO ] Computed 23 invariants in 12 ms
[2024-05-23 08:47:49] [INFO ] Implicit Places using invariants in 975 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 979 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/467 places, 719/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 443 /443 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1021 ms. Remains : 443/467 places, 719/1120 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 161 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 619 ms. (64 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
// Phase 1: matrix 719 rows 443 cols
[2024-05-23 08:47:50] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 08:47:50] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 412/417 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/434 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 08:47:51] [INFO ] Deduced a trap composed of 353 places in 416 ms of which 5 ms to minimize.
[2024-05-23 08:47:52] [INFO ] Deduced a trap composed of 378 places in 447 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 9/443 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 719/1162 variables, 443/467 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 90/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1162 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1162/1162 variables, and 557 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 412/415 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/433 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/443 variables, 10/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 719/1162 variables, 443/467 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 90/557 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 2/559 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1162 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1162 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1162/1162 variables, and 559 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 443/443 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 3004ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 3 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 719/719 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 443 transition count 620
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 344 transition count 620
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 198 place count 344 transition count 531
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 376 place count 255 transition count 531
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 254 transition count 512
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 254 transition count 512
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 2 with 2 rules applied. Total rules applied 380 place count 253 transition count 511
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 253 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 382 place count 252 transition count 510
Applied a total of 382 rules in 54 ms. Remains 252 /443 variables (removed 191) and now considering 510/719 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 252/443 places, 510/719 transitions.
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
// Phase 1: matrix 510 rows 252 cols
[2024-05-23 08:47:54] [INFO ] Computed 22 invariants in 7 ms
[2024-05-23 08:47:54] [INFO ] State equation strengthened by 90 read => feed constraints.
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) 221/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/232 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 510/762 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/762 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 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) 221/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/232 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 510/762 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/762 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 510/510 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 251 transition count 509
Applied a total of 2 rules in 18 ms. Remains 251 /252 variables (removed 1) and now considering 509/510 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 251/252 places, 509/510 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 237609 steps, run visited all 1 properties in 959 ms. (steps per millisecond=247 )
Probabilistic random walk after 237609 steps, saw 175374 distinct states, run finished after 963 ms. (steps per millisecond=246 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2))]
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-12 finished in 8175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-23 08:47:56] [INFO ] Computed 23 invariants in 10 ms
[2024-05-23 08:47:56] [INFO ] Implicit Places using invariants in 747 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 748 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 13 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 780 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-13 finished in 1271 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 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 45 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-23 08:47:57] [INFO ] Computed 23 invariants in 5 ms
[2024-05-23 08:47:58] [INFO ] Implicit Places using invariants in 810 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 813 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 17 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-23 08:47:58] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 08:47:58] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-23 08:47:58] [INFO ] Invariant cache hit.
[2024-05-23 08:47:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 08:48:00] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2593 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-15 finished in 3066 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)||(!p0&&F(G(!p1)))))'
[2024-05-23 08:48:00] [INFO ] Flatten gal took : 121 ms
[2024-05-23 08:48:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-23 08:48:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 467 places, 1120 transitions and 4294 arcs took 22 ms.
Total runtime 506209 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 467
TRANSITIONS: 1120
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.033s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 3073
MODEL NAME: /home/mcc/execution/414/model
467 places, 1120 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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
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="Anderson-PT-10"
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 Anderson-PT-10, 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 r003-smll-171620117600364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 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 ;